The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - Jan. (2013 vol.19)
pp: 45-55
Ying Yang , Sch. of Eng. & Comput. Sci., Durham Univ., Durham, UK
N. Peyerimhoff , Dept. of Math. Sci., Durham Univ., Durham, UK
I. Ivrissimtzis , Sch. of Eng. & Comput. Sci., Durham Univ., Durham, UK
ABSTRACT
We study the relationship between the noise in the vertex coordinates of a triangle mesh and normal noise. First, we compute in closed form the expectation for the angle θ between the new and the old normal when uniform noise is added to a single vertex of a triangle. Next, we propose and experimentally validate an approximation and lower and upper bounds for θ when uniform noise is added to all three vertices of the triangle. In all cases, for small amounts of spatial noise that do not severely distort the mesh, there is a linear correlation between θ and simple functions of the heights of the triangles and thus, θ can be computed efficiently. The addition of uniform spatial noise to a mesh can be seen as a dithered quantization of its vertices. We use the obtained linear correlations between spatial and normal noise to compute the level of dithered quantization of the mesh vertices when a tolerance for the average normal distortion is given.
INDEX TERMS
mesh generation, approximation theory, computational geometry, average normal distortion, linear correlations, spatial noise, normal noise, triangle meshes, uniform noise, dithered vertex quantization, mesh vertices, Noise, Quantization, Degradation, Upper bound, Linear approximation, Rendering (computer graphics), normal noise, mesh generation, approximation theory, computational geometry, average normal distortion, linear correlations, spatial noise, normal noise, triangle meshes, uniform noise, dithered vertex quantization, mesh vertices, Noise, Quantization, Degradation, Upper bound, Linear approximation, Rendering (computer graphics), vertex quantization, Triangle mesh
CITATION
Ying Yang, N. Peyerimhoff, I. Ivrissimtzis, "Linear Correlations between Spatial and Normal Noise in Triangle Meshes", IEEE Transactions on Visualization & Computer Graphics, vol.19, no. 1, pp. 45-55, Jan. 2013, doi:10.1109/TVCG.2012.106
REFERENCES
[1] C. Touma and C. Gotsman, "Triangle Mesh Compression," Proc. Graphics Interface, pp. 26-34, 1998.
[2] P. Alliez and M. Desbrun, "Progressive Compression for Lossless Transmission of Triangle Meshes," Proc. ACM SIGGRAPH, pp. 195-202, 2001.
[3] B. Walter, S. Zhao, N. Holzschuch, and K. Bala, "Single Scattering in Refractive Media with Triangle Mesh Boundaries," Proc. ACM SIGGRAPH, pp. 1-8, 2009.
[4] S. Jin, R. Lewis, and D. West, "A Comparison of Algorithms for Vertex Normal Computation," The Visual Computer, vol. 21, nos. 1/2, pp. 71-82, 2005.
[5] Q. Meyer, J. Susharpmuth, G. Susharpner, M. Stamminger, and G. Greiner, "On Floating-Point Normal Vectors," Computer Graphics Forum, vol. 29, pp. 1405-1409, June 2010.
[6] M. Pauly, N. Mitra, and L. Guibas, "Uncertainty and Variability in Point Cloud Surface Data," Proc. Symp. Point-Based Graphics (SoPBG), pp. 77-84, 2004.
[7] A. Kalaiah and A. Varshney, "Statistical Geometry Representation for Efficient Transmission and Rendering," ACM Trans. Graphics, vol. 24, no. 2, pp. 348-373, 2005.
[8] M. Yoon, I. Ivrissimtzis, and S. Lee, "Variational Bayesian Noise Estimation of Point Sets," Computers and Graphics, vol. 33, no. 3, pp. 226-234, 2009.
[9] X. Sun, P. Rosin, R. Martin, and F. Langbein, "Noise Analysis and Synthesis for 3D Laser Depth Scanners," Graphical Models, vol. 71, no. 2, pp. 34-48, 2009.
[10] O. Sorkine, D. Cohen-Or, and S. Toledo, "High-Pass Quantization for Mesh Encoding," Proc. Eurographics/ACM SIGGRAPH Symp. Geometry Processing, pp. 42-51, 2003.
[11] L. Schuchman, "Dither Signals and Their Effect on Quantization Noise," IEEE Trans. Comm. Technology, vol. CT-12, no. 4, pp. 162-165, Dec. 1964.
[12] R. Gray and T. Stockham, "Dithered Quantizers," IEEE Trans. Information Theory, vol. 39, no. 3, pp. 805-812, May 1993.
[13] C. Roads, The Computer Music Tutorial. The MIT Press, 1996.
[14] L. Akarun, Y. Yardunci, and A. Cetin, "Adaptive Methods for Dithering Color Images," IEEE Trans. Image Processing, vol. 6, no. 7, pp. 950-955, July 1997.
[15] L. Kobbelt, S. Campagna, J. Vorsatz, and H.-P. Seidel, "Interactive Multi-Resolution Modeling on Arbitrary Meshes," Proc. ACM SIGGRAPH, pp. 105-114, 1998.
[16] I. Guskov, W. Sweldens, and P. Schröder, "Multiresolution Signal Processing for Meshes," Proc. ACM SIGGRAPH, pp. 325-334, 1999.
[17] H. Hoppe, "View-Dependent Refinement of Progressive Meshes," Proc. ACM SIGGRAPH, pp. 189-198, 1997.
[18] W. Pasman and F.W. Jansen, "Scheduling Level of Detail with Guaranteed Quality and Cost," Proc. Seventh Int'l Conf. 3D Web Technology (Web3D '02), pp. 43-51, 2002.
[19] L. Hu, P.V. Sander, and H. Hoppe, "Parallel View-Dependent Refinement of Progressive Meshes," Proc. Symp. Interactive 3D Graphics and Games (I3D '09), pp. 169-176, 2009.
[20] M.-W. Chao, C.-H. Lin, C.-W. Yu, and T.-Y. Lee, "A High Capacity 3D Steganography Algorithm," IEEE Trans. Visualization and Computer Graphics, vol. 15, no. 2, pp. 274-284, Mar./Apr. 2009.
[21] F. Cayre and B. Macq, "Data Hiding on 3-d Triangle Meshes," IEEE Trans. Signal Processing, vol. 51, no. 4, pp. 939-949, Apr. 2003.
[22] C.-M. Wang and Y.-M. Cheng, "An Efficient Information Hiding Algorithm for Polygon Models," Computer Graphics Forum, vol. 24, pp. 591-600, 2005.
[23] Y.-M. Cheng and C.-M. Wang, "An Adaptive Steganographic Algorithm for 3d Polygonal Meshes," The Visual Computer, vol. 23, no. 9, pp. 721-732, 2007.
[24] A. Bogomjakov, C. Gotsman, and M. Isenburg, "Distortion-Free Steganography for Polygonal Meshes," Computer Graphics Forum, vol. 27, no. 2, pp. 637-642, 2008.
[25] S.-C. Tu, W.-K. Tai, M. Isenburg, and C.-C. Chang, "An Improved Data Hiding Approach for Polygon Meshes," Visual Computer, vol. 26, pp. 1177-1181, Sept. 2010.
[26] S. Zafeiriou, A. Tefas, and I. Pitas, "Blind Robust Watermarking Schemes for Copyright Protection of 3d Mesh Objects," IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 5, pp. 596-607, Sept./Oct. 2005.
[27] K. Wang, F. Dennis, G. Lavoue, and A. Baskurt, "Hierarchical Watermarking of Semiregular Meshes Based on Wavelet Transform," IEEE Trans. Information Forensics and Security, vol. 3, no. 4, pp. 620-634, Dec. 2008.
[28] Y. Yang and I. Ivrissimtzis, "Polygonal Mesh Watermarking Using Laplacian Coordinates," Computer Graphics Forum, vol. 29, no. 5, pp. 1585-1593, 2010.
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool