{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:00:21Z","timestamp":1760241621173,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T00:00:00Z","timestamp":1530057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MO 3050\/2-1","LI 1530\/6-2"],"award-info":[{"award-number":["MO 3050\/2-1","LI 1530\/6-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Clustering algorithms in the high-dimensional space require many data to perform reliably and robustly. For multivariate volume data, it is possible to interpolate between the data points in the high-dimensional attribute space based on their spatial relationship in the volumetric domain (or physical space). Thus, sufficiently high number of data points can be generated, overcoming the curse of dimensionality for this particular type of multidimensional data. We applies this idea to a histogram-based clustering algorithm. We created a uniform partition of the attribute space in multidimensional bins and computed a histogram indicating the number of data samples belonging to each bin. Without interpolation, the analysis was highly sensitive to the histogram cell sizes, yielding inaccurate clustering for improper choices: Large histogram cells result in no cluster separation, while clusters fall apart for small cells. Using an interpolation in physical space, we could refine the data by generating additional samples. The depth of the refinement scheme was chosen according to the local data point distribution in attribute space and the histogram\u2019s bin size. In the case of field discontinuities representing sharp material boundaries in the volume data, the interpolation can be adapted to locally make use of a nearest-neighbor interpolation scheme that avoids averaging values across the sharp boundary. Consequently, we could generate a density computation, where clusters stay connected even when using very small bin sizes. We exploited this result to create a robust hierarchical cluster tree, apply our technique to several datasets, and compare the cluster trees before and after interpolation.<\/jats:p>","DOI":"10.3390\/info9070156","type":"journal-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T11:02:05Z","timestamp":1530097325000},"page":"156","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Upsampling for Improved Multidimensional Attribute Space Clustering of Multifield Data"],"prefix":"10.3390","volume":"9","author":[{"given":"Vladimir","family":"Molchanov","sequence":"first","affiliation":[{"name":"Department of Mathematics and Informatics, Westf\u00e4lische Wilhelms-Universit\u00e4t M\u00fcnster, 48149 M\u00fcnster, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Linsen","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Informatics, Westf\u00e4lische Wilhelms-Universit\u00e4t M\u00fcnster, 48149 M\u00fcnster, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"key":"ref_1","unstructured":"Whalen, D., and Norman, M.L. (2018, June 20). Competition Data Set and Description. 2008 IEEE Visualization Design Contest. Available online: http:\/\/vis.computer.org\/VisWeek2008\/vis\/contests.html."},{"key":"ref_2","unstructured":"(2018, June 20). Competition Data Set and Description. 2010 IEEE Visualization Design Contest. Available online: http:\/\/viscontest.sdsc.edu\/2010\/."},{"key":"ref_3","unstructured":"Bellman, R.E. (1957). Dynamic Programming, Princeton University Press."},{"key":"ref_4","first-page":"29","article-title":"Overcoming the Curse of Dimensionality When Clustering Multivariate Volume Data","volume":"Volume 3","author":"Molchanov","year":"2018","journal-title":"Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/TVCG.2006.165","article-title":"Multifield-Graphs: An Approach to Visualizing Correlations in Multifield Scalar Data","volume":"12","author":"Sauber","year":"2006","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/TVCG.2006.164","article-title":"Multi-variate, Time Varying, and Comparative Visualization with Contextual Cues","volume":"12","author":"Woodring","year":"2006","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_7","unstructured":"Akiba, H., and Ma, K.L. (2007, January 23\u201325). A Tri-Space Visualization Interface for Analyzing Time-Varying Multivariate Volume Data. Proceedings of the Eurographics\/IEEE VGTC Symposium on Visualization, Norrkoping, Sweden."},{"key":"ref_8","unstructured":"Blaas, J., Botha, C.P., and Post, F.H. (2007, January 23\u201325). Interactive Visualization of Multi-Field Medical Data Using Linked Physical and Feature-Space Views. Proceedings of the Eurographics\/IEEE VGTC Symposium on Visualization (EuroVis), Norrkoping, Sweden."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1560","DOI":"10.1109\/TVCG.2010.170","article-title":"Interactive Vector Field Feature Identification","volume":"16","author":"Daniels","year":"2010","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1109\/TVCG.2009.185","article-title":"Structuring Feature Space: A Non-Parametric Method for Volumetric Transfer Function Generation","volume":"15","author":"Maciejewski","year":"2009","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1483","DOI":"10.1109\/TVCG.2008.167","article-title":"Surface extraction from multi-field particle volume data using multi-dimensional cluster visualization","volume":"14","author":"Linsen","year":"2008","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/MCG.2009.45","article-title":"Linking multi-dimensional feature space cluster visualization to surface extraction from multi-field volume data","volume":"29","author":"Linsen","year":"2009","journal-title":"IEEE Comput. Graph. Appl."},{"key":"ref_13","unstructured":"Dobrev, P., Long, T.V., and Linsen, L. (2011, January 4\u20136). A Cluster Hierarchy-based Volume Rendering Approach for Interactive Visual Exploration of Multi-variate Volume Data. Proceedings of the 16th International Workshop on Vision, Modeling and Visualization (VMV 2011), Berlin, Germany."},{"key":"ref_14","unstructured":"Jain, A.K., and Dubes, R.C. (1988). Algorithms for Clustering Data, Prentice Hall."},{"key":"ref_15","unstructured":"Han, J., and Kamber, M. (2006). Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers."},{"key":"ref_16","unstructured":"Hartigan, J.A. (1975). Clustering Algorithms, Wiley."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01908064","article-title":"Statistical Theory in Clustering","volume":"2","author":"Hartigan","year":"1985","journal-title":"J. Classif."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1111\/j.2517-6161.1983.tb01262.x","article-title":"A kth Nearest Neighbor Clustering Procedure","volume":"45","author":"Wong","year":"1983","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_19","unstructured":"Ester, M., Kriegel, H.P., Sander, J., and Xu, X. (1996, January 2\u20134). A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, OR, USA."},{"key":"ref_20","unstructured":"Hinneburg, A., and Keim, D. (1998, January 27\u201331). An efficient approach to clustering in large multimedia databases with noise. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, New York, NY, USA."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/38.788795","article-title":"HD-Eye: Visual Mining of High-Dimensional Data","volume":"19","author":"Hinneburg","year":"1999","journal-title":"IEEE Comput. Graph. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., and Sander, J. (1999, January 1\u20134). OPTICS: Ordering points to identify the clustering structure. Proceedings of the 1999 ACM SIGMOD International Conference On Management of Data, Seattle, WA, USA.","DOI":"10.1145\/304182.304187"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00357-003-0004-6","article-title":"Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample","volume":"20","author":"Stuetzle","year":"2003","journal-title":"J. Classif."},{"key":"ref_24","first-page":"397","article-title":"A generalized single linkage method for estimating the cluster tree of a density","volume":"19","author":"Stuetzle","year":"2007","journal-title":"Tech. Rep."},{"key":"ref_25","unstructured":"Long, T.V. (2009). Visualizing High-Density Clusters in Multidimensional Data. [Ph.D. Thesis, School of Engineering and Science, Jacobs University]."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1428","DOI":"10.1109\/TVCG.2008.119","article-title":"Continuous Scatterplots","volume":"14","author":"Bachthaler","year":"2008","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1111\/j.1467-8659.2009.01478.x","article-title":"Efficient and Adaptive Rendering of 2-D Continuous Scatterplots","volume":"28","author":"Bachthaler","year":"2009","journal-title":"Comput. Graph. Forum"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1111\/j.1467-8659.2011.01914.x","article-title":"Progressive Splatting of Continuous Scatterplots and Parallel Coordinates","volume":"30","author":"Heinrich","year":"2011","journal-title":"Comput. Graph. Forum"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1109\/TVCG.2010.146","article-title":"Discontinuities in Continuous Scatter Plots","volume":"16","author":"Lehmann","year":"2010","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1109\/TVCG.2011.200","article-title":"Features in Continuous Parallel Coordinates","volume":"17","author":"Lehmann","year":"2011","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","article-title":"Chameleon: Hierarchical Clustering Using Dynamic Modeling","volume":"32","author":"Karypis","year":"1999","journal-title":"Computer"},{"key":"ref_32","unstructured":"Crawfis, R., and Max, N. (1993, January 26). Texture Splats for 3D Vector and Scalar Field Visualization. Proceedings of the 4th Conference on Visualization \u201993, San Jose, CA, USA."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/7\/156\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:10:20Z","timestamp":1760195420000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/7\/156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":32,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2018,7]]}},"alternative-id":["info9070156"],"URL":"https:\/\/doi.org\/10.3390\/info9070156","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2018,6,27]]}}}