{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T01:43:12Z","timestamp":1772674992746,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2022,6,4]],"date-time":"2022-06-04T00:00:00Z","timestamp":1654300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,4]],"date-time":"2022-06-04T00:00:00Z","timestamp":1654300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00521-022-07404-0","type":"journal-article","created":{"date-parts":[[2022,6,4]],"date-time":"2022-06-04T15:02:42Z","timestamp":1654354962000},"page":"17783-17792","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["High embedding capacity in 3D model using intelligent Fuzzy based clustering"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1852-2803","authenticated-orcid":false,"given":"Modigari","family":"Narendra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. L.","family":"Valarmathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Jani","family":"Anbarasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Vergin Raja","family":"Sarobin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fadi","family":"Al-Turjman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,4]]},"reference":[{"issue":"5\u20136","key":"7404_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0925-7721(96)00024-7","volume":"7","author":"B Chazelle","year":"1997","unstructured":"Chazelle B, Dobkin DP, Shouraboura N, Tal A (1997) Strategies for polyhedral surface decomposition: an experimental study. Comput Geometry 7(5\u20136):327\u2013342","journal-title":"Comput Geometry"},{"issue":"3","key":"7404_CR2","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1145\/882262.882369","volume":"22","author":"S Katz","year":"2003","unstructured":"Katz S, Tal A (2003) Hierarchical mesh decomposition using fuzzy clustering and cuts. ACM Trans Gr (TOG) 22(3):954\u2013961","journal-title":"ACM Trans Gr (TOG)"},{"key":"7404_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1111\/1467-8659.00581","volume":"21","author":"S Shlafman","year":"2002","unstructured":"Shlafman S, Tal A, Katz S (2002) Metamorphosis of polyhedral surfaces using decomposition. Comput Gr Forum 21:219\u2013228","journal-title":"Comput Gr Forum"},{"key":"7404_CR4","doi-asserted-by":"crossref","unstructured":"Garland M, Willmott A, Heckbert PS (2001) \u201cHierarchical face clustering on polygonal surfaces,\u201d In: Proceedings of the 2001 symposium on Interactive 3D graphics, pp\u00a049\u201358","DOI":"10.1145\/364338.364345"},{"key":"7404_CR5","doi-asserted-by":"crossref","unstructured":"Gelfand N, Guibas LJ (2004) \u201cShape segmentation using local slippage analysis,\u201d In Proceedings of the 2004 Eurographics\/ACM SIGGRAPH symposium on Geometry processing, pp\u00a0214\u2013223","DOI":"10.1145\/1057432.1057461"},{"key":"7404_CR6","unstructured":"Liu R, Zhang H (2004) \u201cSegmentation of 3d meshes through spectral clustering,\u201d In: 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings. pp\u00a0298\u2013305, IEEE"},{"issue":"1","key":"7404_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TMM.2006.886344","volume":"9","author":"H-YS Lin","year":"2006","unstructured":"Lin H-YS, Liao H-YM, Lin J-C (2006) Visual salience-guided mesh decomposition. IEEE Trans Multimedia 9(1):46\u201357","journal-title":"IEEE Trans Multimedia"},{"key":"7404_CR8","doi-asserted-by":"crossref","unstructured":"Lai Y-K, Hu S-M, Martin RR, Rosin PL (2008) \u201cFast mesh segmentation using random walks,\u201d In: Proceedings of the 2008 ACM symposium on Solid and physical modeling, pp\u00a0183\u2013191","DOI":"10.1145\/1364901.1364927"},{"key":"7404_CR9","doi-asserted-by":"crossref","unstructured":"Golovinskiy A, Funkhouser T (2008) \u201cRandomized cuts for 3d mesh analysis,\u201d In: ACM SIGGRAPH Asia 2008 papers, pp\u00a01\u201312","DOI":"10.1145\/1457515.1409098"},{"issue":"3","key":"7404_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00371-006-0375-x","volume":"22","author":"M Attene","year":"2006","unstructured":"Attene M, Falcidieno B, Spagnuolo M (2006) Hierarchical mesh segmentation based on fitting primitives. Vis Comput 22(3):181\u2013193","journal-title":"Vis Comput"},{"issue":"4","key":"7404_CR11","first-page":"705","volume":"28","author":"T-C Ho","year":"2012","unstructured":"Ho T-C, Chuang J-H et al (2012) Volume based mesh segmentation. J Inform Sci Eng 28(4):705\u2013722","journal-title":"J Inform Sci Eng"},{"issue":"2","key":"7404_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.fcij.2017.10.007","volume":"2","author":"OM El Zein","year":"2017","unstructured":"El Zein OM, El Bakrawy LM, Ghali NI (2017) A robust 3d mesh watermarking algorithm utilizing fuzzy c-means clustering. Future Comput Informat J 2(2):148\u2013156","journal-title":"Future Comput Informat J"},{"issue":"1","key":"7404_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3DRes.01(2013)1","volume":"4","author":"P Thiyagarajan","year":"2013","unstructured":"Thiyagarajan P, Natarajan V, Aghila G, Venkatesan VP, Anitha R (2013) Pattern based image steganography. 3D Res 4(1):1","journal-title":"3D Res"},{"key":"7404_CR14","doi-asserted-by":"publisher","unstructured":"Soliman MM, Hassanien AE, Onsi HM (2015) A Robust 3D Mesh Watermarking Approach Using Genetic Algorithms. In: Intelligent Systems'2014. Advances in Intelligent Systems and Computing, vol 323. Springer, Cham, pp 731\u2013741. https:\/\/doi.org\/10.1007\/978-3-319-11310-4_64","DOI":"10.1007\/978-3-319-11310-4_64"},{"key":"7404_CR15","doi-asserted-by":"crossref","unstructured":"Mouhamed MR, Soliman MM, Darwish AA, Hassanien AE (2018) Interest points detection of 3d mesh model using k means and shape curvature, In: International Conference on Advanced Intelligent Systems and Informatics, pp\u00a0415\u2013424, Springer","DOI":"10.1007\/978-3-319-99010-1_38"},{"key":"7404_CR16","doi-asserted-by":"crossref","unstructured":"Motwani RC, Motwani MC, Bryant BD, Harris\u00a0Jr FC, Agarwal AS (2010) \u201cWatermark embedder optimization for 3d mesh objects using classification based approach, In: 2010 International Conference on Signal Acquisition and Processing, pp\u00a0125\u2013129, IEEE","DOI":"10.1109\/ICSAP.2010.83"},{"issue":"7","key":"7404_CR17","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1109\/5.771065","volume":"87","author":"FA Petitcolas","year":"1999","unstructured":"Petitcolas FA, Anderson RJ, Kuhn MG (1999) Information hiding-a survey. Proc IEEE 87(7):1062\u20131078","journal-title":"Proc IEEE"},{"key":"7404_CR18","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1111\/j.1467-8659.2008.01161.x","volume":"27","author":"A Bogomjakov","year":"2008","unstructured":"Bogomjakov A, Gotsman C, Isenburg M (2008) Distortion-free steganography for polygonal meshes. Comput Gr Forum 27:637\u2013642","journal-title":"Comput Gr Forum"},{"issue":"3","key":"7404_CR19","first-page":"1321","volume":"9","author":"C-H Lin","year":"2013","unstructured":"Lin C-H, Chao M-W, Chen J-Y, Yu C-W, Hsu W-Y (2013) A high-capacity distortion-free information hiding algorithm for 3D polygon models. Int J Innov Comput Inf Control 9(3):1321\u20131335","journal-title":"Int J Innov Comput Inf Control"},{"issue":"9","key":"7404_CR20","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s00371-006-0069-4","volume":"22","author":"Y-M Cheng","year":"2006","unstructured":"Cheng Y-M, Wang C-M (2006) A high-capacity steganographic approach for 3D polygonal meshes. Vis Comput 22(9):845\u2013855","journal-title":"Vis Comput"},{"issue":"1","key":"7404_CR21","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/TVCG.2012.106","volume":"19","author":"Y Yang","year":"2012","unstructured":"Yang Y, Peyerimhoff N, Ivrissimtzis I (2012) Linear correlations between spatial and normal noise in triangle meshes. IEEE Trans Visual Comput Gr 19(1):45\u201355","journal-title":"IEEE Trans Visual Comput Gr"},{"issue":"3","key":"7404_CR22","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s11042-012-1135-8","volume":"69","author":"Y-Y Tsai","year":"2014","unstructured":"Tsai Y-Y (2014) An adaptive steganographic algorithm for 3D polygonal models using vertex decimation. Multimed Tools Appl 69(3):859\u2013876","journal-title":"Multimed Tools Appl"},{"issue":"4","key":"7404_CR23","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/49.668977","volume":"16","author":"R Ohbuchi","year":"1998","unstructured":"Ohbuchi R, Masuda H, Aono M (1998) Watermarking three-dimensional polygonal models through geometric and topological modifications. IEEE J Sel Areas Commun 16(4):551\u2013560","journal-title":"IEEE J Sel Areas Commun"},{"issue":"4","key":"7404_CR24","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TSP.2003.809380","volume":"51","author":"F Cayre","year":"2003","unstructured":"Cayre F, Macq B (2003) Data hiding on 3-D triangle meshes. IEEE Trans Signal Process 51(4):939\u2013949","journal-title":"IEEE Trans Signal Process"},{"key":"7404_CR25","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1111\/j.1467-8659.2005.00884.x","volume":"24","author":"C-M Wang","year":"2005","unstructured":"Wang C-M, Cheng Y-M (2005) An efficient information hiding algorithm for polygon models. Comput Gr Forum 24:591\u2013600","journal-title":"Comput Gr Forum"},{"issue":"2","key":"7404_CR26","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1109\/TVCG.2008.94","volume":"15","author":"M-W Chao","year":"2008","unstructured":"Chao M-W, Lin C-H, Yu C-W, Lee T-Y (2008) A high capacity 3D steganography algorithm. IEEE Trans Visual Comput Graphics 15(2):274\u2013284","journal-title":"IEEE Trans Visual Comput Graphics"},{"issue":"4","key":"7404_CR27","first-page":"287","volume":"16","author":"H Garg","year":"2013","unstructured":"Garg H, Agarwal S (2013) A secure image based watermarking for 3D polygon mesh. Sci Technol 16(4):287\u2013303","journal-title":"Sci Technol"},{"issue":"3","key":"7404_CR28","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1631\/jzus.2004.0251","volume":"5","author":"J Jian-qiu","year":"2004","unstructured":"Jian-qiu J, Min-ya D, Hu-jun B, Qun-sheng P (2004) Watermarking on 3D mesh based on spherical wavelet transform. J Zhejiang Univ-Sci A 5(3):251\u2013258","journal-title":"J Zhejiang Univ-Sci A"},{"key":"7404_CR29","doi-asserted-by":"crossref","unstructured":"Kwon K-R, Kwon S-G, Lee S-H, Kim T-S, Lee K-I (2003) Watermarking for 3d polygonal meshes using normal vector distributions of each patch, In: Proceedings 2003 International Conference on Image Processing (Cat. No. 03CH37429), vol\u00a02, pp\u00a0II\u2013499, IEEE","DOI":"10.1109\/ICIP.2003.1246726"},{"key":"7404_CR30","doi-asserted-by":"crossref","unstructured":"Karni Z, Gotsman C (2000) Spectral compression of mesh geometry, In: Proceedings of the 27th annual conference on Computer graphics and interactive techniques, pp\u00a0279\u2013286","DOI":"10.1145\/344779.344924"},{"issue":"2\u20133","key":"7404_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","volume":"10","author":"JC Bezdek","year":"1984","unstructured":"Bezdek JC, Ehrlich R, Full W (1984) Fcm: the fuzzy c-means clustering algorithm. Comput Geosci 10(2\u20133):191\u2013203","journal-title":"Comput Geosci"},{"key":"7404_CR32","doi-asserted-by":"crossref","unstructured":"Atallah MJ (1983) A linear time algorithm for the hausdorff distance between convex polygons, Department of computer science technical reports","DOI":"10.1016\/0020-0190(83)90042-X"},{"issue":"12","key":"7404_CR33","first-page":"28","volume":"4","author":"LK Sharma","year":"2015","unstructured":"Sharma LK, Ojha DB (2015) Imperceptible watermarking scheme for 3D triangular mesh. Int J Appl Innov Eng Manag 4(12):28\u201334","journal-title":"Int J Appl Innov Eng Manag"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07404-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07404-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07404-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T13:07:20Z","timestamp":1727356040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07404-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,4]]},"references-count":33,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["7404"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07404-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,4]]},"assertion":[{"value":"14 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors Modigari Narendra, M L Valarmathi, L Jani Anbarasi, Vergin Raja Sarobin M, and Fadi Al-Turjman declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}