The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - March/April (2010 vol.16)
pp: 312-324
Hanqi Fan , Zhejiang University, Hangzhou
Yizhou Yu , University of Illinois at Urbana-Champaign, Urbana
Qunsheng Peng , Zhejiang University, Hangzhou
ABSTRACT
In this paper, we introduce a feature-preserving denoising algorithm. It is built on the premise that the underlying surface of a noisy mesh is piecewise smooth, and a sharp feature lies on the intersection of multiple smooth surface regions. A vertex close to a sharp feature is likely to have a neighborhood that includes distinct smooth segments. By defining the consistent subneighborhood as the segment whose geometry and normal orientation most consistent with those of the vertex, we can completely remove the influence from neighbors lying on other segments during denoising. Our method identifies piecewise smooth subneighborhoods using a robust density-based clustering algorithm based on shared nearest neighbors. In our method, we obtain an initial estimate of vertex normals and curvature tensors by robustly fitting a local quadric model. An anisotropic filter based on optimal estimation theory is further applied to smooth the normal field and the curvature tensor field. This is followed by second-order bilateral filtering, which better preserves curvature details and alleviates volume shrinkage during denoising. The support of these filters is defined by the consistent subneighborhood of a vertex. We have applied this algorithm to both generic and CAD models, and sharp features, such as edges and corners, are very well preserved.
INDEX TERMS
Denoising, features, clustering, shared nearest neighbors, normals, curvature tensors, quadrics, bilateral filtering.
CITATION
Hanqi Fan, Yizhou Yu, Qunsheng Peng, "Robust Feature-Preserving Mesh Denoising Based on Consistent Subneighborhoods", IEEE Transactions on Visualization & Computer Graphics, vol.16, no. 2, pp. 312-324, March/April 2010, doi:10.1109/TVCG.2009.70
REFERENCES
[1] M. Levoy et al., “The Digital Michelangelo Project 3d Scanning of Large Statues,” Proc. 27th Ann. Conf. Computer Graphics and Interactive Techniques, pp. 131-144, 2000.
[2] S. Rusinkiewicz, O. Hall-Holt, and M. Levoy, “Real-Time 3d Model Acquisition,” Proc. 29th Ann. Conf. Computer Graphics and Interactive Techniques, pp. 438-446, 2002.
[3] S. Fleishman, D. Cohen-Or, and C. Silva, “Robust Moving Least-Squares Fitting with Sharp Features,” Proc. ACM SIGGRAPH '05, vol. 24, no. 3, pp. 544-552, 2005.
[4] L. Ertöz, M. Steinbach, and V. Kumar, “Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data,” Proc. SIAM Int'l Conf. Data Mining, 2003.
[5] A. Gelb, Applied Optimal Estimation. MIT Press, 1974.
[6] G. Taubin, “A Signal Processing Approach to Fair Surface Design,” Proc. 22nd Ann. Conf. Computer Graphics and Interactive Techniques, pp. 351-358, 1995.
[7] M. Desbrun, M. Meyer, P. Schröder, and A. Barr, “Implicit Fairing of Irregular Meshes Using Diffusion and Curvature Flow,” Proc. 26th Ann. Conf. Computer Graphics and Interactive Techniques, pp.317-324, 1999.
[8] U. Clarenz, U. Diewald, and M. Rumpf, “Anisotropic Geometric Diffusion in Surface Processing,” Proc. Conf. Visualization '00, pp.397-405, 2000.
[9] G. Taubin, “Linear Anisotropic Mesh Filtering,” IBM Research Report RC2213, 2001.
[10] C. Bajaj and G. Xu, “Anisotropic Diffusion on Surfaces and Functions on Surfaces,” ACM Trans. Graphics, vol. 22, no. 1, pp. 4-32, 2003.
[11] S. Fleishman, I. Drori, and D. Cohen-Or, “Bilateral Mesh Denoising,” Proc. Int'l Conf. Computer Graphics and Interactive Techniques, pp. 950-953, 2003.
[12] T. Jones, F. Durand, and M. Desbrun, “Non-Iterative, Feature-Preserving Mesh Smoothing,” ACM Trans. Graphics, vol. 22, no. 3, pp. 943-949, 2003.
[13] H. Yagou, Y. Ohtake, and A. Belyaev, “Mesh Denoising via Iterative Alpha-Trimming and Nonlinear Diffusion of Normals with Automatic Thresholding,” Proc. Computer Graphics Int'l, 2003.
[14] F. Duguet, F. Durand, and G. Drettakis, “Robust Higher-Order Filtering of Points,” Technical Report RR-5165, INRIA, 2004.
[15] L. Kobbelt, S. Campagna, J. Vorsatz, and H.-P. Seidel, “Interactive Multi-Resolution Modeling on Arbitrary Meshes,” Proc. ACM SIGGRAPH '98, pp. 105-114, 1998.
[16] R. Schneider and L. Kobbelt, “Geometric Fairing of Irregular Meshes for Free-Form Surface Design,” Computer Aided Geometric Design, vol. 18, pp. 359-379, 2001.
[17] T. Tasdizen, R. Whitaker, P. Burchard, and S. Osher, “Geometric Surface Processing via Normal Maps,” ACM Trans. Graphics, vol. 22, no. 4, pp. 1012-1033, 2003.
[18] Y. Ohtake, A. Belyaev, and I. Bogaevski, “Polyhedral Surface Smoothing with Simultaneous Mesh Regularization,” Proc. Conf. Geometric Modeling and Processing '00 (Theory and Applications), pp.229-237, 2000.
[19] M. Desbrun, M. Meyer, P. Schroder, and A. Barr, “Anisotropic Feature-Preserving Denoising of Height Fields and Bivariate Data,” Graphics Interface, vol. 11, no. 10, pp. 145-152, 2000.
[20] C. Tomasi and R. Manduchi, “Bilateral Filtering for Gray and Color Images,” Proc. Sixth Int'l Conf. Computer Vision, p. 839, 1998.
[21] F. Durand and J. Dorsey, “Fast Bilateral Filtering for the Display of High-Dynamic-Range Images,” Proc. 29th Ann. Conf. Computer Graphics and Interactive Techniques, pp. 257-266, 2002.
[22] D. Barash, “Fundamental Relationship between Bilateral Filtering, Adaptivesmoothing, and the Nonlinear Diffusion Equation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 6, pp.844-847, June 2002.
[23] H. Takeda, S. Farsiu, and P. Milanfar, “Higher Order Bilateral Filters and Their Properties,” Proc. SPIE Conf. Computational Imaging V, vol. 6498, p. 64, 2007.
[24] K. Hildebrandt and K. Polthier, “Anisotropic Filtering of Non-Linear Surface Features,” Computer Graphics Forum, vol. 23, no. 3, pp. 391-400, 2004.
[25] Y. Yu, K. Zhou, D. Xu, X. Shi, H. Bao, B. Guo, and H.-Y. Shum, “Mesh Editing with Poisson-Based Gradient Field Manipulation,” ACM Trans. Graphics, special issue for ACM SIGGRAPH 2004, vol. 23, no. 3, pp. 641-648, 2004.
[26] K. Lee and W. Wang, “Feature-Preserving Mesh Denoising via Bilateral Normal Filtering,” Proc. Ninth Int'l Conf. Computer Aided Design and Computer Graphics 2005, p. 6, 2005.
[27] X. Sun, P. Rosin, R. Martin, and F. Langbein, “Fast and Effective Feature-Preserving Mesh Denoising,” IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 5, pp. 925-938, Sept./Oct. 2007.
[28] X. Sun, P. Rosin, R. Martin, and F. Langbein, “Random Walks for Feature-Preserving Mesh Denoising,” Computer Aided Geometric Design, vol. 25, no. 7, pp. 437-456, 2008.
[29] H. Hoppe, T. DeRose, T. Duchamp, M. Halstead, H. Jin, J. McDonald, J. Schweitzer, and W. Stuetzle, “Piecewise Smooth Surface Reconstruction,” Proc. 21st Ann. Conf. Computer Graphics and Interactive Techniques, pp. 295-302, 1994.
[30] N. Amenta and Y. Kil, “Defining Point-Set Surfaces,” ACM Trans. Graphics, vol. 23, no. 3, pp. 264-270, 2004.
[31] J.I. Daniels, L.K. Ha, T. Ochotta, and C.T. Silva, “Robust Smooth Feature Extraction from Point Clouds,” Proc. IEEE Int'l Conf. Shape Modeling and Applications (SMI '07), pp. 123-136, 2007.
[32] M. do Carmo, Differential Geometry of Curves and Surfaces. Prentice-Hall, 1976.
[33] R. Garimella and B. Swartz, “Curvature Estimation for Unstructured Triangulations of Surfaces,” Technical Report LA-UR-03-8240, Los Alamos Nat'l Lab, 2003.
[34] P. Huber, Robust Statistics. Wiley Interscience, 2004.
[35] P. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining. Addison-Wesley Longman Publishing Co., Inc., 2005.
[36] M. Steinbach, P. Tan, V. Kumar, S. Klooster, and C. Potter, “Discovery of Climate Indices Using Clustering,” Proc. Ninth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 446-455, 2003.
[37] R. Jarvis and E. Patrick, “Clustering Using a Similarity Measure Based on Shared Near Neighbors,” IEEE Trans. Computers, vol. C-22, no. 11, pp. 1025-1034, Nov. 1973.
[38] S. Gumhold, X. Wang, and R. MacLeod, “Feature Extraction from Point Clouds,” Proc. 10th Int'l Meshing Roundtable, pp. 293-305, 2001.
[39] M. Garland and P. Heckbert, “Surface Simplification Using Quadric Error Metrics,” Proc. ACM SIGGRAPH, vol. 97, no. 31, pp.209-216, 1997.
[40] S. Mathur and F. Ferrie, “Edge Localization in Surface Reconstruction Using Optimal Estimation Theory,” Proc. 1997 Conf. Computer Vision and Pattern Recognition (CVPR), 1997.
[41] F. Ferrie, J. Lagarde, and P. Whaite, “Darboux Frames, Snakes, and Super-Quadrics: Geometry from the Bottom Up,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 8, pp. 771-784, Aug. 1993.
[42] M. Liu, Y. Liu, and K. Ramani, “Anisotropic Filtering on Normal Field and Curvature Tensor Field Using Optimal Estimation Theory,” Proc. IEEE Int'l Conf. Shape Modeling and Applications 2007, pp. 169-178, 2007.
[43] J. Bouguet and P. Perona, “3D Photography on Your Desk,” Proc. Sixth Int'l Conf. Computer Vision '98, pp. 43-50, 1998.
[44] Intel, Intel®64 and IA-32 Architectures Optimization Reference Manual, http://download.intel.com/design/processor/ manuals 248966.pdf, 2009.
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool