Acquisition And Representation Of Object Surface Data
07 Jul 1986-Vol. 0602, pp 42-49
TL;DR: A simple, low cost, and universal automatic 3-D acquisition system was developped using active triangulation, which presents several advantages of the resulting data base which is structured like a picture data base and can take advantage of this structure to develop very fast processing techniques.
Abstract: A simple, low cost, and universal automatic 3-D acquisition system was developped using active triangulation. Its main characteristics are: - its speed of acquisition (about 1 minute per object), - the density of its sampling (from 30,000 to 250,000 measures per object), - the structured lattice of the resulting data (distributed on parallel and meridian equidistant lines). From these data, it is possible to use several techniques of surface approximation to compress the information: some of them are presented here, with their respective performances (quality, compression rate, complexity of programming). They are divided into two main classes: - planar approximations, - spline function approximations. We also present several advantages of the resulting data base which is structured like a picture data base. We can take advantage of this structure to develop very fast processing techniques.
Citations
More filters
TL;DR: In this paper, an indirect method for meshing parametric surfaces conforming to a user-specifiable size map is presented, based on the intrinsic properties of the surface, the Riemannian structure is induced into the parametric space.
Abstract: An indirect method for meshing parametric surfaces conforming to a user-specifiable size map is presented. First, from this size specification, a Riemannian metric is defined so that the desired mesh is one with unit length edges with respect to the related Riemannian space (the so-called ‘unit mesh’). Then, based on the intrinsic properties of the surface, the Riemannian structure is induced into the parametric space. Finally, a unit mesh is generated completely inside the parametric space such that it conforms to the metric of the induced Riemannian structure. This mesh is constructed using a combined advancing-front—Delaunay approach applied within a Riemannian context. The proposed method can be applied to mesh composite parametric surfaces. Several examples illustrate the efficiency of our approach. Copyright © 2000 John Wiley & Sons, Ltd.
110 citations
Cites methods from "Acquisition And Representation Of O..."
...In this section, we focus on the surface meshing problem of a real object from a set of sampled points obtained using the three-dimensional digitalization system ‘3D Videolaser’ ([24])....
[...]
...Bust of Victor Hugo In this section, we focus on the surface meshing problem of a real object from a set of sampled points obtained using the three-dimensional digitalization system ‘3D Videolaser’ ([24])....
[...]
TL;DR: It is described how the use of B-Spline surfaces allows lissom movements of body and face and can be combined with a muscles model for facial animation as illustrated for the speech.
Abstract: In this paper we describe how the use of B-Spline surfaces allows lissom movements of body and face. Our method is empirical, based on a parametrical animation. It can be combined with a muscles model for facial animation as we illustrated for the speech.
95 citations
Cites background or methods from "Acquisition And Representation Of O..."
...The face's data that we used have been obtained by an automatic 3-D digitizing system elaborated by the laboratoire Image of the Ecole Nationale Superieure des Telecommunications [7]....
[...]
...These include expressions of: - joy - disgust - surprise - sadness - anger - fear What varies according to culture are " the rules for emotional expression or the conditions for the release of each emot ion" [7], but not the use of specific muscles related to each expression....
[...]
TL;DR: A solution method, based on nonlinear programming techniques, is presented for the problem of matching two series of observations of a 2-D contour, in which each sampling of the contour has different hidden parts.
35 citations
TL;DR: In this article, distance deviations (denoted by A"0" and angle deviations (A"1) between the mesh and the exact surface are measured and isotropic or anisotropic sizing functions are specified for generating quality meshes while bounding A" 0 and/or A" 1 deviations.
16 citations
Cites background or methods from "Acquisition And Representation Of O..."
...It can also be used after an interpolation of a structured grid of points, resulting for instance from a 3D digitizer [1]....
[...]
...The input data is a set of sampled points provided by the tridimensional digitalization system “3D Videolaser” at ENST [1]....
[...]
09 Jun 1986
TL;DR: A method is proposed for the determination of a progressive polyhedral approximation of 3-D digitized surfaces whose points are located on a regular lattice that allows for the measurement of the local quality of the approximation and avoids the generation of ill-defined triangles with sharp corners.
Abstract: A method is proposed for the determination of a progressive polyhedral approximation of 3-D digitized surfaces whose points are located on a regular lattice. It relies on an iterative and adaptative splitting of the triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is operated. The algorithm allows for the measurement of the local quality of the approximation and avoids the generation of ill-defined triangles with sharp corners. Its low computational complexity permits the approximation of very large sets of points (hundreds of thousands).
7 citations
References
More filters
Book•
11 Feb 1984
TL;DR: This invaluable reference helps readers assess and simplify problems and their essential requirements and complexities, giving them all the necessary data and methodology to master current theoretical developments and applications, as well as create new ones.
Abstract: Image Processing and Mathematical Morphology-Frank Y. Shih 2009-03-23 In the development of digital multimedia, the importance and impact of image processing and mathematical morphology are well documented in areas ranging from automated vision detection and inspection to object recognition, image analysis and pattern recognition. Those working in these ever-evolving fields require a solid grasp of basic fundamentals, theory, and related applications—and few books can provide the unique tools for learning contained in this text. Image Processing and Mathematical Morphology: Fundamentals and Applications is a comprehensive, wide-ranging overview of morphological mechanisms and techniques and their relation to image processing. More than merely a tutorial on vital technical information, the book places this knowledge into a theoretical framework. This helps readers analyze key principles and architectures and then use the author’s novel ideas on implementation of advanced algorithms to formulate a practical and detailed plan to develop and foster their own ideas. The book: Presents the history and state-of-the-art techniques related to image morphological processing, with numerous practical examples Gives readers a clear tutorial on complex technology and other tools that rely on their intuition for a clear understanding of the subject Includes an updated bibliography and useful graphs and illustrations Examines several new algorithms in great detail so that readers can adapt them to derive their own solution approaches This invaluable reference helps readers assess and simplify problems and their essential requirements and complexities, giving them all the necessary data and methodology to master current theoretical developments and applications, as well as create new ones.
9,566 citations
Proceedings Article•
24 Aug 1981
TL;DR: This paper describes an approach to the recognition of stacked objects with planar and curved surfaces by a combination of data-driven and model-driven search processes.
Abstract: This paper describes an approach to the recognition of stacked objects with planar and curved surfaces. The range data of a scene are obtained by a range finder. The system works In two phases. In a learning phase, a scene containing a single object Is described In terms of properties of regions and relations between them. This description Is stored as an object model. In a recognition phase, an unknown scene Is described In the same way as In the learning phase. And then the description is matched to the object models so that stacked objects are recognized one by one. Efficient matching is achieved by a combination of data-driven and model-driven search process. Experimental results for blocks and machine parts are shown.
282 citations
01 Feb 1984-Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing
TL;DR: An efficient way of building a polyhedral approximation of a set of points in 3-D space is described, where the points are the vertices of a planar graph embedded in a surface of genus 0 and are obtained by a laser range finder.
Abstract: An efficient way of building a polyhedral approximation of a set of points in 3-D space is described. The points are the vertices of a planar graph embedded in a surface of genus 0 and are obtained by a laser range finder. The technique presented here is a generalization of an existing algorithm (R. Duda and P. Hart, Pattern Classification and Scene Analysis, Wiley-Interscience, New York 1973) for the polygonal approximation of a simple curve in 2-D space.
77 citations
09 Jun 1986
TL;DR: A method is proposed for the determination of a progressive polyhedral approximation of 3-D digitized surfaces whose points are located on a regular lattice that allows for the measurement of the local quality of the approximation and avoids the generation of ill-defined triangles with sharp corners.
Abstract: A method is proposed for the determination of a progressive polyhedral approximation of 3-D digitized surfaces whose points are located on a regular lattice. It relies on an iterative and adaptative splitting of the triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is operated. The algorithm allows for the measurement of the local quality of the approximation and avoids the generation of ill-defined triangles with sharp corners. Its low computational complexity permits the approximation of very large sets of points (hundreds of thousands).
7 citations