سامانه ‏های غیرخطی در مهندسی برق

سامانه ‏های غیرخطی در مهندسی برق

مش‌بندی مجدد غیر ایزوتروپیک مدل‌های سه بعدی با رویکرد نمونه-برداری وفقی

نوع مقاله : مقاله پژوهشی

نویسندگان
آزمایشگاه تحقیقاتی بینایی کامپیوتر، دانشکده مهندسی برق، دانشگاه صنعتی سهند، تبریز، ایران
چکیده
امروزه گسترش گوشی­های هوشمند و نرم افزارهای سه بعدی به کار رفته در این سیستم ها، نیاز به پردازش سریع مدل­های سه بعدی را کاملا آشکار می­سازد. ولی حجم بالای رئوس و وجوه موجود در مدل­های سه بعدی، سرعت ارسال و دریافت داده­ها را کاهش داده و حافظه ذخیره سازی بیشتری را می­طلبد. در این مقاله، روشی برای مش­بندی مجدد غیرایزوترپیک مدل­­های سه بعدی پیشنهاد می­شود. در این روش از معیار نایکوئیست برای نمونه برداری از مدل اصلی استفاده می­شود. این معیار به صورت محلی برروی هر بخش از مش اعمال شده و فرایند نمونه­برداری را انجام می­دهد. سپس، مش­بندی مجدد به نقاط نمونه­برداری شده افزوده شده و مدل ساده­سازی شده تشکیل می­شود. جهت کسب مدل با کیفیت بالا از مدل مش­بندی شده جدید، از یک روش درون­یابی زیر تقسیم غیر خطی استفاده می­شود. نتایج بدست آمده نشان می­دهند که الگوریتم ارائه شده علاوه بر کاهش تعداد رئوس و وجوه مدل، توانایی حفظ جزئیات را به خوبی دارد. الگوریتم پیشنهادی با روش­های شناخته شده در زمینه ساده­سازی مش مقایسه شده و نتایج بدست آمده گویای توانایی روش پیشنهادی در بازسازی مدلی با کیفیت بالا است.
کلیدواژه‌ها

[1] P. Hinker and C. Hansen, "Geometric Optimization," In: Proceedings of the 4th Conference on
Visualization ’93. VIS ’93. San Jose, California: IEEE Computer Society, pp. 189–195, 1993.
[2] A.D. Kalvin and R.H. Taylor, "Superfaces: Polygonal Mesh Simplification with Bounded Error,"
In: IEEE Comput. Graph. Appl, vol. 16, no.3, pp. 64–77, 1996.
[3] D. Luebke and C. Erikson, "View-dependent Simplification of Arbitrary Polygonal Environments,"
In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques.
SIGGRAPH ’97. New York, NY, USA: ACM Press/Addison-Wesley Publishing Co, pp. 199–208,
1997.
[4] S. Schaefer and J. Warren, "Adaptive Vertex Clustering Using Octrees," In: SIAM Geometric
Design and Computing, pp. 491–500, 2003.
[5] T. Kanaya and K.I. Kobori, "A Method of Model Simplification Using Spatial Partitioning," In:
The Journal of the Institute of Image Information and Television Engineers 56.4, pp. 636–642,
2002.
[6] G. Pengdong, L. Ameng, L. Yongquan, W. Jintao, L. Nan, and Y. Wenhua, "Adaptive Mesh
Simplification Using Vertex Clustering with Topology Preserving," In: Computer Science and
Software Engineering, 2008 International Conference on. Wuhan, Hubei: IEEE, pp. 971 –974,
2008.
[7] L. Nan, G. Pengdong, L. Yongquan, L. Ameng, and Y. Wenhua, "A New Adaptive Mesh
Simplification Method Using Vertex Clustering with Topology-and-Detail Preserving," In:
Proceedings of the 2008 International Symposium on Information Science and Engieering -
Volume 01. ISISE ’08. Washington, DC, USA: IEEE Computer Society, pp. 150– 153, 2008.
[8] K.L. Low and T.S. Tan, "Model Simplification Using Vertex clustering," In: Proceedings of the
1997 Symposium on Interactive 3D Graphics. I3D ’97. Providence, Rhode Island, USA: ACM,
75–ff, 1997.
[9] W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, "Decimation of Triangle Meshes," In: Proceedings
of the 19th Annual Conference on Computer Graphics and Interactive Techniques. SIGGRAPH
’92. New York, NY, USA: ACM, pp. 65–70, 1992.
[10] J.C. Xia, J. El-Sana, and A. Varshney, "Adaptive Real-Time Level-of-Detail-Based Rendering for
Polygonal Models," In: IEEE Transactions on Visualization and Computer Graphics, vol. 3, no. 2,
pp. 171–183, 1997.
[11] R. Ronfard and J. Rossignac, "Full-range Approximation of Triangulated Polyhedra," In: Computer
Graphics Forum 15, pp. 67–76, 1996.
[12] M.E. Algorri and F. Schmitt, "Mesh Simplification," In: Proceedings of the 1996 Eurographics,
Tutorials, pp. 77–86, 1996.
[13] W.J. Schroeder, "A Topology Modifying Progressive Decimation Algorithm," In: Proceedings of
the 8th Conference on Visualization ’97. VIS ’97. Phoenix, Arizona, USA: IEEE Computer Society
Press, pp. 205–212, 1997.
[14] M. Garland and P.S. Heckbert, "Surface Simplification Using Quadric Error Metrics," In:
Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques.
SIGGRAPH ’97. New York, NY, USA: ACM Press/Addison-Wesley Publishing Co., pp. 209–216,
1997.
[15] E. Ovreiu, S. Valette, V. Buzuloiu, and R. Prost, "Mesh simplification using an accurate measured
quadratic error," In: 10th International Symposium on Signals, Circuits and Systems (ISSCS). IEEE
Computer Society, pp. 1–4, 2011.
[16] P. Alliez, N. Laurent, H. Sanson, and F. Schmitt, "Mesh Approximation Using a Volume-Based
Metric," In: Proceedings of the 7th Pacific Conference on Computer Graphics and Applications.
PG ’99. Washington, DC, USA: IEEE Computer Society, pp. 292–301, 1999.
[17] B. Hamann, "A Data Reduction Scheme for Triangulated Surfaces," In: Computer Aided Geometric
Design, vol. 11, no. 2, pp. 197–214, 1994.
[18] M.H. Gross, G.S. Oliver, and R. Gatti, "Efficient Triangular Surface Approximations Using
Wavelets and Quadtree Data Structures," In: IEEE Transactions on Visualization and Computer
Graphics, vol. 2, no. 2, pp. 130-143, 1996.
[19] P. Lindstrom and G. Turk, "Image-driven Simplification," In: ACM Trans. Graph, vol. 19, no. 3,
pp. 204–241, 2000.
[20] B. Fritzke, "A Growing Neural Gas Network Learns Topologies," In: Advances in Neural
Information Processing Systems 7. MIT Press, pp. 625–632, 1995.
[21] R. Álvarez, J.V. Noguera, L. Tortosa, and A. Zamora, "A Mesh Optimization Algorithm Based on
Neural Networks," In: Information Sciences, vol. 177, no. 23, pp. 5347–5364, 2007.
[22] R. Álvarez, J. Noguera, L. Tortosa, and A. Zamora, "GNG3D - A Software Tool for Mesh
Optimization Based on Neural Networks," In: International Joint Conference on Neural Networks.
IEEE Computer Society, pp. 4005–4012, 2006.
[23] H. Lee and M.H. Kyung, "Parallel mesh simplification using embedded tree collapsing," The
Visual Computer, vol. 32, no. 6-8, pp. 967-976, 2016.
[24] A. Papageorgiou and N. Platis, "Triangular mesh simplification on the GPU," The Visual
Computer, vol. 31, no. 2, pp. 235-244, 2015.
[25] X. Liu, L. Lin, J. Wu, W. Wang, B. Yin, and C.CL. Wang, "Generating sparse self-supporting
wireframe models for 3D printing using mesh simplification," Graphical Models, vol. 98, no. 4,
pp. 14-23, 2018.
[26] S. Tsuchie, "Mesh simplification accompanied by its denoising of scanned data," Engineering with
Computers, vol. 35, no. 3, pp. 993-1008, 2019.
[27] J. She, X. Gu, J. Tan, M. Tong, and C. Wang, "An appearance‐preserving simplification method
for complex 3D building models," Transactions in GIS, vol. 23, no. 2, pp. 275-293, 2019.
[28] D. Salinas, F. Lafarge, and P. Alliez, "Structure‐Aware Mesh Decimation," In Computer Graphics
Forum, vol. 34, no. 6, pp. 211-227. 2015.
[29] L. Asgharian and H. Ebrahimnezhad, "How many sample points are sufficient for 3D model surface
representation and accurate mesh simplification?," Multimedia Tools and Applications, vol. 79, no.
39, pp.29595-29620, 2020.
[30] F.A. Marvasti, "Reconstruction of two-dimensional signals from nonuniform samples or partial
information," JOSA A, vol. 6, no. 1, pp. 52-55, 1989.
[31] S. Curtis, S. Shitz, and A. Oppenheim, "Reconstruction of nonperiodic two-dimensional signals
from zero crossings," IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 35, no.
6, pp. 890-893, 1987.
[32] P. Alliez, D. Cohen-Steiner, O. Devillers, B. Lévy, and M. Desbrun, "Anisotropic polygonal
remeshing," In ACM Transactions on Graphics (TOG), vol. 22, no. 3, pp. 485-493. ACM, 2003.
[33] H. Schreier, J.J. Orteu, and M.A. Sutton, "Image correlation for shape, motion and deformation
measurements: Basic concepts, theory and applications," vol. 1. Boston, MA: Springer-Verlag US,
2009.
[34] L.D. Cohen, "Multiple contour finding and perceptual grouping using minimal paths," Journal of
Mathematical Imaging and Vision, vol. 14, no. 3, pp. 225-236, 2001.
[35] G. Peyré and L.D. Cohen, "Geodesic remeshing using front propagation," International Journal of
Computer Vision, vol. 69, no. 1, pp. 145, 2006.
[36] G. Lavoué, "A multiscale metric for 3D mesh visual quality assessment," In Computer Graphics
Forum, vol. 30, no. 5, pp. 1427-1437. Oxford, UK: Blackwell Publishing Ltd, 2011.
[37] P. Cignoni, C. Rocchini, and R. Scopigno, "Metro: measuring error on simplified surfaces,"
In Computer Graphics Forum, vol. 17, no. 2, pp. 167-174. Oxford, UK and Boston, USA:
Blackwell Publishers, 1998.
[38] P. Cignoni, M. Callieri, M. Corsini, M. Dellepiane, F. Ganovelli, and G. Ranzuglia, "Meshlab: an
open-source mesh processing tool," In Eurographics Italian chapter conference, vol. 2008, pp. 129-
136, 2008.
[39] A.M. Bronstein, M.M. Bronstein, and R. Kimmel, "Efficient computation of isometry-invariant
distances between surfaces," SIAM Journal on Scientific Computing, vol. 28, no. 5, pp.1812-1836,
2006.
[40] M. Garland, "Quadric-based polygonal surface simplification," Thesis (No. CMU-CS-99-105).
Carnegie-Mellon University of Pittsburgh, School of Computer Science, 1999.
[41] E. Ovreiu, "Accurate 3D mesh simplification," Doctoral dissertation, INSA de Lyon, 2012.
[42] J. Wei and Y. Lou, "Feature preserving mesh simplification using feature sensitive metric," Journal
of Computer Science and Technology, vol. 25, no. 3, pp.595-605, 2010.

  • تاریخ دریافت 21 تیر 1404
  • تاریخ اولین انتشار 21 تیر 1404
  • تاریخ انتشار 01 فروردین 1400