Simplification of 3D head mesh acquired from laser scanner

• Autorzy: Ye J.
• Języki publikacji: EN

Abstrakty

EN

Complex triangle meshes arise extensively in computer graphics. Such meshes greatly exceed the processing power of modern computer hardware and need to be simplified. The purpose of this paper is to simplify a 3D color human head mesh acquired from a 3D laser scanner. It is more important to keep the boundaries and quality of the sense organs which are the region of interest, while it is reasonable to simplify other features of the head aggressively, such as hair, face and neck. Based on these heuristics, we present a novel vertex merging mesh simplification algorithm based on region segmentation. The algorith can be divided into two stages: segmentation and simplification. First, the 3D color head mesh is segmented into different head parts with respect to both geometry and attributes, then vertices are classified into region-inner vertices and region-boundary vertices. Second, interative vertex merging is applied using region-weighted error metric in order to implement controllable simplifications. Results of several experiments are shown, demonstrating the potential of our method for a 3D color head mesh. Also, our method is resistant to noise in practical applications.

Słowa kluczowe

EN

mesh simplification; level of detail; 3D color head mesh; laser scanner

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 2002
• Tom: Vol. 11, No. 4
• Strony: 489--498
• Opis fizyczny: Bibliogr. 13 poz.

Twórcy

autor

Ye J.

• Image Processing and Intelligent Control Key Laboratory of China, Institute of Pattern Recognition and Artificial Intelligence,, Huazhong University of Science and Technology, Wuhan 430074, P.R. China http://ia.hust.edu.cn,

Bibliografia

• [1] Cark J. H.: Hicrarchical gcometric models for visible surface algorithms. Comm. of the ACM, 19, 547-554. 1976.
• [2] Turk G., Levoy M.: Zippered polygon meshes from range images. Proc. or SIGGRAPH, Orlando, Florida, USA, 311-318. 1994.
• [3] Hoppe H.: Progressive meshes. Proc. of SIGGRAPH, 30, 99-108. 1996.
• [4] Heckbert P. S., Garland M.: Survey of polygonal surface simplification algorithms. In Multiresolution Surface Modeling Course Notes, ACM SIGGRAPH. 1997.
• [5] Garland M., Heckbcrt P. S.: Surface simplification using quadric error metrics. Proc. of SIGGRAPH, 209-216. 1997.
• [6] Cohen J., Olano M., Manocha D.: Appearance-preserving simplification. SIGGRAPH 98 Conf.Proc., 115-122. 1998
• [7] Garland M., Heckbert P. S.: Simplifying surfaces with color and texture using quadric error metrics. Proc. of IEEE Conf. on Visualization, 264-270. 1998.
• [8] Lindstrom P., Turk G.: Fast and memory efficient polygonal simplification. Proc. of IEEE Conf. on Visualization, Oct., 279-286. 1998.
• [9] Melax S.: A simple, fast, and effective polygon reduction algorithm. Game Developer, vol. 11. 1998.
• [10] Cignoni P., Montani C., Rocchini C., Scopigno R., Tarini M.: Preserving attribute values on simplified meshes by resampling detail textures. The Visual Computer, 15(10), 519-539. 1999.
• [11] Garland M.: Multiresolution modeling survey future opportunities. Proc. of EUROGRAPHICS. 1999.
• [12] Hoppe H.: New quadric metric for simplifying meshes with appearance attributes. Proc. of IEEE Conf. on Visualization, 59-66. 1999.
• [13] Hoppe H., Sander P. V.: Texture-mapping progressive meshes. Proc. of SIGGRAPH, 409-416. 2001.