
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Patrick Oesterling, Christian Heine, Heike Jänicke, Gerik Scheuermann, Gerhard Heyer, "Visualization of HighDimensional Point Clouds Using Their Density Distribution's Topology," IEEE Transactions on Visualization and Computer Graphics, vol. 17, no. 11, pp. 15471559, November, 2011.  
BibTex  x  
@article{ 10.1109/TVCG.2011.27, author = {Patrick Oesterling and Christian Heine and Heike Jänicke and Gerik Scheuermann and Gerhard Heyer}, title = {Visualization of HighDimensional Point Clouds Using Their Density Distribution's Topology}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {17}, number = {11}, issn = {10772626}, year = {2011}, pages = {15471559}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2011.27}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  Visualization of HighDimensional Point Clouds Using Their Density Distribution's Topology IS  11 SN  10772626 SP1547 EP1559 EPD  15471559 A1  Patrick Oesterling, A1  Christian Heine, A1  Heike Jänicke, A1  Gerik Scheuermann, A1  Gerhard Heyer, PY  2011 KW  Clustering KW  pattern analysis KW  point clouds KW  graphs KW  topology. VL  17 JA  IEEE Transactions on Visualization and Computer Graphics ER   
[1] G. Weber, P.T. Bremer, and V. Pascucci, “Topological Landscapes: A Terrain Metaphor for Scientific Data,” IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 6, pp. 14161423, Nov./Dec. 2007.
[2] Graphical Methods for Data Analysis, J.M. Chambers, W.S. Cleveland, B. Kleiner, and P.A. Tukey, eds. Wadsworth Int'l Group, 1983.
[3] A. Inselberg and B. Dimsdale, “Parallel Coordinates: A Tool for Visualizing MultiDimensional Geometry,” VIS '90: Proc. First Conf. Visualization, pp. 361378, 1990.
[4] R.A. Becker and W.S. Cleveland, “Brushing Scatterplots,” Technometrics, vol. 29, no. 2, pp. 127142, 1987.
[5] A. Tatu, G. Albuquerque, M. Eisemann, J. Schneidewind, H. Theisel, M. Magnor, and D. Keim, “Combining Automated Analysis and Visualization Techniques for Effective Exploration of HighDimensional Data,” Proc. IEEE Symp. Visual Analytics Science and Technology (VAST), pp. 5966, 2009.
[6] I.T. Jolliffe, Principal Component Analysis. Springer, 2002.
[7] K. Fukunaga, Introduction to Statistical Pattern Recognition, second ed. Academic Press Professional, Inc., 1990.
[8] J.B. Kruskal and M. Wish, Multidimensional Scaling (Quantitative Applications in the Social Sciences). SAGE Publications, 1978.
[9] T. Kohonen, SelfOrganizing Maps, third ed. SpringerVerlag, 2001.
[10] J. Choo, S. Bohn, and H. Park, “TwoStage Framework for Visualization of Clustered High Dimensional Data,” Proc. IEEE Symp. Visual Analytics Science and Technology (VAST), pp. 6774, 2009.
[11] E.J. Nam, Y. Han, K. Mueller, A. Zelenyuk, and D. Imre, “Clustersculptor: A Visual Analytics Tool for HighDimensional Data,” Proc. IEEE Symp. Visual Analytics Science and Technology (VAST), pp. 7582, 2007.
[12] R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, “Automatic Subspace Clustering of High Dimensional Data,” Data Mining Knowledge Discovery, vol. 11, no. 1, pp. 533, 2005.
[13] C.C. Aggarwal, J.L. Wolf, P.S. Yu, C. Procopiuc, and J.S. Park, “Fast Algorithms for Projected Clustering,” Proc. ACM SIGMOD Conf. Management of Data, 1999.
[14] L. Kaufman and P. Rousseeuw, Finding Groups in Data An Introduction to Cluster Analysis. Wiley Interscience, 1990.
[15] A. Hinneburg and D.A. Keim, “An Efficient Approach to Clustering in Large Multimedia Databases with Noise,” Proc. Knowledge Discovery and Data Mining (KDD), pp. 5865, 1998.
[16] M. Ester, H.P. Kriegel, J. Sander, and X. Xu, “A DensityBased Algorithm for Discovering Clusters in Large Spatial Databases with Noise,” Proc. Second Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 226231, 1996.
[17] S. Takahashi, I. Fujishiro, and M. Okada, “Applying Manifold Learning to Plotting Approximate Contour Trees,” IEEE Trans. Visualization and Computer Graphics (TVCG), vol. 15, no. 6, pp. 11851192, Nov./Dec. 2009.
[18] S. Fortune, Voronoi Diagrams and Delaunay Triangulations. World Scientific Press, pp. 193233, 1992.
[19] M. De Berg, O. Cheong, and M. van Kreveld, Computational Geometry: Algorithms and Applications. Springer, 2008.
[20] G. Jaromczyk and J.W. Toussaint, “Relative Neighborhood Graphs and Their Relatives,” Proc. IEEE, vol. 80, no. 9, pp. 15021517, Sept. 1992.
[21] R.K. Gabriel and R.R. Sokal, “A New Statistical Approach to Geographic Variation Analysis,” Systematic Zoology, vol. 18, no. 3, pp. 259270, 1969.
[22] M. Levoy, “Display of Surfaces from Volume Data,” IEEE Computer Graphics and Applications, vol. 8, no. 3, pp. 2937, May 1988.
[23] W.E. Lorensen and H.E. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” SIGGRAPH Computer Graphics, vol. 21, no. 4, pp. 163169, 1987.
[24] G.H. Weber, G. Scheuermann, and B. Hamann, “Detecting Critical Regions in Scalar Fields,” Proc. IEEE TCVG Symp. Visualization, pp. 111, 2003.
[25] R.L. Boyell and H. Ruston, “Hybrid Techniques for RealTime Radar Simulation,” AFIPS '63 (Fall): Proc. Nov. 1214, 1963, Fall Joint Computer Conf., pp. 445458, 1963.
[26] H. Carr, J. Snoeyink, and U. Axen, “Computing Contour Trees in All Dimensions,” Computational Geometry, vol. 24, no. 2, pp. 7594, 2003.
[27] H. Edelsbrunner, D. Letscher, and A. Zomorodian, “Topological Persistence and Simplification,” Discrete and Computational Geometry, vol. 28, no. 4, pp. 511533, 2002.
[28] V. Pascucci, K. ColeMcLaughlin, and G. Scorzelli, “The Toporrery: Computation and Presentation of MultiResolution Topology,” Proc. Math. Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, pp. 1940, 2009.
[29] B.W. Silverman, Density Estimation for Statistics and Data Analysis, no. 26. Chapman and Hall, 1986.
[30] Y. Livnat, H.W. Shen, and C.R. Johnson, “A Near Optimal Isosurface Extraction Algorithm Using the Span Space,” IEEE Trans. Visualization and Computer Graphics, vol. 2, no. 1, pp. 7384, Mar. 1996.
[31] D. CohenSteiner, H. Edelsbrunner, and J. Harer, “Stability of Persistence Diagrams,” Discrete and Computational Geometry, vol. 37, pp. 103120, 2007.
[32] A. Frank and A. Asuncion, “UCI Machine Learning Repository,” http://archive.ics.uci.eduml, 2010.
[33] M.A. Fanty and R. Cole, “Spoken Letter Recognition,” Proc. Conf. Advances in Neural Information Processing Systems (NIPS), 1990.
[34] M. Forina, C. Armanino, S. Lanteri, and E. Tiscornia, “Classification of Olive Oils from Their Fatty Acid Composition,” Proc. Food Research and Data Analysis, pp. 189214, 1983.
[35] J. Handl and J. Knowles, “Cluster Generators for Large HighDimensional Data Sets with Large Numbers of Clusters,” http://dbkgroup.org/handlgenerators, 2005.