Applying manifold learning to plotting approximate contour trees

IEEE Transactions on Visualization and Computer Graphics

Volumn 15, Issue 6, 2009, Pages 1185-1192

  Takahashi, Shigeo ^a   Fujishiro, Issei ^b   Okada, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b KEIO UNIVERSITY   (Japan)

Author keywords

Contour trees; high dimensional data analysis; manifold learning; time varying volumes

Indexed keywords

3-D SPACE; COARSE-TO-FINE; CONTOUR TREES; DATA SIZE; DIMENSIONALITY REDUCTION; DISTANCE METRICS; EXTRACTING FEATURES; HIGH DIMENSIONAL DATA; HIGH DIMENSIONAL SPACES; HIGHER-DIMENSIONAL; ISO SURFACE; LARGE-SCALE DATASETS; LOW-DIMENSIONAL SPACES; MANIFOLD LEARNING; SAMPLE POINT; SINGLE VALUED FUNCTIONS; SOFTWARE IMPLEMENTATION; TEMPORAL BEHAVIOR; TIME VARYING; TOPOLOGICAL EVOLUTION;

DATA REDUCTION; FEATURE EXTRACTION; TIME VARYING SYSTEMS; TOPOLOGY;

TREES (MATHEMATICS);

EID: 77957850951     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2009.119     Document Type: Conference Paper

References (38)

1. C. L. Bajaj, V. Pascucci, and D. R. Schikore. The contour spectrum. In Proc. IEEE Vis.'97, pages 167-173, 1997.
2. M. Belkin and P. Niyogi. Laplacian eigenmaps for spectral embedding and clustering. Neural Computations, 15(6):1373-1396, 2003.
3. R. L. Boyell and H. Ruston. Hybrid techniques for real-time radar simulation. In IEEE Proc. Fall Joint Computer Conf., pages 445-458, 1963.
4. H. Carr and J. Snoeyink. Path seeds and flexible isosurfaces using topology for exploratory visualization. In Proc. Joint Eurographics-IEEE TCVG Symp. Visualization 2003, pages 49-58, 285, 2003.
5. H. Carr and J. Snoeyink. Representing interpolant topology for contour tree computation. In Topology-Based Methods in Visualization II, pages 59-73. Springer, 2009.
6. H. Carr, J. Snoeyink, and U. Axen. Computing contour trees in all dimensions. Computational Geometry: Theory and Applications, 24(2):75-94, 2003.
7. H. Carr, J. Snoeyink, and M. van de Panne. Simplifying flexible isosurfaces using local geometric measures. In Proc. IEEE Vis. 2004, pages 497-504, 2004.
8. K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pas-cucci. Loops in Reeb graph of 2-manifolds. In Proc. 19th ACM Symp. Computational Geometry, pages 344-350, 2003.
9. T. Cox and M. Cox. Multidimensional Scaling. Chapman & Hall, London, 1994.
10. V. de Silva and J. B. Tanenbaum. Global versus local method in nonlinear dimensionality reduction. In Proc. Neural Information Processing Systems Conf. 2002, pages 705-712, 2002.
11. H. Edelsbrunner, J. Harer, A. Mascarenhas, and V. Pascucci. Time-varying Reeb graphs for continuous space-time data. In Proc. 20th ACM Symp. Computational Geometry, pages 366-372, 2004.
12. I. Fujishiro, T. Azuma, Y. Takeshima, and S. Takahashi. Volume data mining using 3D field topology analysis. IEEE CG&A, 20(5):46-51, 2000.
13. I. Fujishiro, R. Otsuka, S. Takahashi, and Y. Takeshima. T-map: A topo-logical approach to visual exploration of time-varying volume data. In Proc. 6th Int'l Symp. High Performance Computing, volume 4759 of Springer LNCS, pages 176-190, 2008.
14. V. Hernandez, J. E. Roman, A. Tomas, and V. Vidal. SLEPc users manual. Technical report, Technical Univ. of Valencia, Spain, 2004.
15. H. Hoppe. Progressive meshes. In Proc. SIGGRAPH96, pages 99-108, 1996.
16. P. Keller and M. Bertram. Modeling and visualization of time-varying topology transitions guided by hyper Reeb graph structures. In Proc. Computer Graphics and Imaging (CGIM) 2007, 15-20.
17. A. Mascarenhas and J. Snoeyink. Implementing time-varying contour trees. In Proc. 21st ACM Symp. Computational Geometry, pages 370-371, 2005.
18. S. Mizuta and T. Matsuda. Description of digital images by region-based contour trees. In Proc. Int'l Conf. Image Analysis and Recognition 2005, volume 3656 of Springer LNCS, pages 549-558, 2005.
19. V. Pascucci and K. Cole-McLaughlin. Efficient computation of the topology of level sets. In Proc. IEEE Vis. 2002, pages 187-194, 2002.
20. V. Pascucci, K. Cole-McLaughlin, and G. Scorzelli. Multi-resolution computation and presentation of contour trees. In Proc. IASTED Conf. Visualization, Imaging, and Image Processing, 2004. 452-290.
21. V. Pascucci, G. Scorzelli, P.-T. Bremer, and A. Mascarenhas. Robust on-line computation of Reeb graphs: Simplicity and speed. ACM TOG, 26(3):58, 2007.
22. G. Reeb. Sur les points singuliers d'une forme de pfaff completement integrable ou d'une fonction numerique. Comptes Rendus Acad. Sciences Paris, 222:847-849, 1946.
23. S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323-2326, 2000.
24. H. Sakagami, H. Murai, Y. Seo, and M. Yokokawa. 14.9 tflops three-dimensional fluid simulation for fusion science with HPF on the earth simulator. In Proc. ACM/IEEE SC2002, 2002.
25. Y. Shinagawa, Y. L. Kergosien, and T. L. Kunii. Surface coding based on Morse theory. IEEE CG&A, 11(5):66-78, 1991.
26. Y. Shinagawa and T. L. Kunii. Constructing a Reeb graph automatically from cross sections. IEEE CG&A, 11(6):44-51, 1991.
27. B.-S. Sohn and C. Bajaj. Time-varying contour topology. IEEE TVCG, 12(1):14-25, 2006.
28. S. Takahashi, T. Ikeda, Y. Shinagawa, T. L. Kunii, and M. Ueda. Algorithms for extracting correct critical points and constructing topological graphs from discrete geographical elevation data. Computer Graphics Forum, 14(3):181-192, 1995.
29. S. Takahashi, G. M. Nielson, Y. Takeshima, and I. Fujishiro. Topolog-ical volume skeletonization using adaptive tetrahedralization. In Proc. Geometric Modeling and Processing 2004, pages 227-236, 2004.
30. S. Takahashi, Y. Takeshima, and I. Fujishiro. Topological volume skele-tonization and its application to transfer function design. Graphical Models, 66(1):22-49, 2004.
31. Y. Takeshima, S. Takahashi, I. Fujishiro, and G. M. Nielson. Introducing topological attributes for objective-based visualization of simulated datasets. In Proc. Volume Graphics 2005, pages 137-145, 236, 2005.
32. J. Tenenbaum, V. de Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.
33. M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D. Schikore. Contour trees and small seed sets for isosurface traversal. In Proc. 13th ACM Symp. Computational Geometry, pages 212-220, 1997.
34. C. Ware and W. Cowan. The RGYB color geometry. ACM TOG, 9(2):226-232, 1990.
35. G. H. Weber, P.-T. Bremer, and V. Pascucci. Topological landscapes: A terrain metaphor for scientific data. IEEE TVCG, 13(6):1416-1423, 2007.
36. G. H. Weber, S. E. Dillard, H. Carr, V. Pascucci, and B. Hamann. Topology-controlled volume rendering. IEEE TVCG, 13(2):330-341, 2007.
37. G. H. Weber, G. Scheuermann, H. Hagen, and B. Hamann. Exploring scalar fields using critical isovalues. In Proc. IEEE Vis. 2002, pages 171-178, 2002.
38. X. Zhang and C. Bajaj. Extraction, visualization and quantification of protein pockets. In Proc. 6th Annual Int'l Conf. Computational System Bioinformatics (CSB2007), pages 275-286, 2007.