Source: http://cedmav.org/pubs/pubs.html?start=80
Timestamp: 2019-04-25 01:53:58+00:00

Document:
S. Kumar, V. Vishwanath, P. Carns, B. Summa, G. Scorzelli, V. Pascucci, R. Ross, J. Chen, H. Kolla, R. Grout. PIDX: Efficient Parallel I/O for Multi-resolution Multi-dimensional Scientific Datasets, In Proceedings of The IEEE International Conference on Cluster Computing, pp. 103--111. September, 2011.
Valerio Pascucci, Xavier Tricoche, Hans Hagen, Julien Tierny. Topological Methods in Data Analysis and Visualization: Theory, Algorithms, and Applications (Mathematics and Visualization), Springer, 2011.
T. Peterka, R. Ross, A. Gyulassy, V. Pascucci, W. Kendall, H.-W. Shen, T.-Y. Lee, A. Chaudhuri. Scalable Parallel Building Blocks for Custom Data Analysis, In Proceedings of the 2011 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV), pp. 105--112. October, 2011.
S. Philip, B. Summa, P.-T. Bremer, and V. Pascucci. Parallel Gradient Domain Processing of Massive Images, In Proceedings of the 2011 Eurographics Symposium on Parallel Graphics and Visualization, pp. 11--19. 2011.
Gradient domain processing remains a particularly computationally expensive technique even for relatively small images. When images become massive in size, giga or terapixel, these problems become particularly troublesome and the best serial techniques take on the order of hours or days to compute a solution. In this paper, we provide a simple framework for the parallel gradient domain processing. Specifically, we provide a parallel out-of-core method for the seamless stitching of gigapixel panoramas in a parallel MPI environment. Unlike existing techniques, the framework provides both a straightforward implementation, maintains strict control over the required/allocated resources, and makes no assumptions on the speed of convergence to an acceptable image. Furthermore, the approach shows good weak/strong scaling from several to hundreds of cores and runs on a variety of hardware.
S. Philip, B. Summa, P-T Bremer, V. Pascucci. Hybrid CPU-GPU Solver for Gradient Domain Processing of Massive Images, In Proceedings of 2011 International Conference on Parallel and Distributed Systems (ICPADS), pp. 244--251. 2011.
Gradient domain processing is a computationally expensive image processing technique. Its use for processing massive images, giga or terapixels in size, can take several hours with serial techniques. To address this challenge, parallel algorithms are being developed to make this class of techniques applicable to the largest images available with running times that are more acceptable to the users. To this end we target the most ubiquitous form of computing power available today, which is small or medium scale clusters of commodity hardware. Such clusters are continuously increasing in scale, not only in the number of nodes, but also in the amount of parallelism available within each node in the form of multicore CPUs and GPUs. In this paper we present a hybrid parallel implementation of gradient domain processing for seamless stitching of gigapixel panoramas that utilizes MPI, threading and a CUDA based GPU component. We demonstrate the performance and scalability of our implementation by presenting results from two GPU clusters processing two large data sets.
M. Schulz, J.A. Levine, P.-T. Bremer, T. Gamblin, V. Pascucci. Interpreting Performance Data Across Intuitive Domains, In International Conference on Parallel Processing, Taipei, Taiwan, IEEE, pp. 206--215. 2011.
B. Summa, G. Scorzelli, M. Jiang, P.-T. Bremer, V. Pascucci. Interactive Editing of Massive Imagery Made Simple: Turning Atlanta into Atlantis, In ACM Transactions on Graphics, Vol. 30, No. 2, pp. 7:1--7:13. April, 2011.
This article presents a simple framework for progressive processing of high-resolution images with minimal resources. We demonstrate this framework's effectiveness by implementing an adaptive, multi-resolution solver for gradient-based image processing that, for the first time, is capable of handling gigapixel imagery in real time. With our system, artists can use commodity hardware to interactively edit massive imagery and apply complex operators, such as seamless cloning, panorama stitching, and tone mapping.
We introduce a progressive Poisson solver that processes images in a purely coarse-to-fine manner, providing near instantaneous global approximations for interactive display (see Figure 1). We also allow for data-driven adaptive refinements to locally emulate the effects of a global solution. These techniques, combined with a fast, cache-friendly data access mechanism, allow the user to interactively explore and edit massive imagery, with the illusion of having a full solution at hand. In particular, we demonstrate the interactive modification of gigapixel panoramas that previously required extensive offline processing. Even with massive satellite images surpassing a hundred gigapixels in size, we enable repeated interactive editing in a dynamically changing environment. Images at these scales are significantly beyond the purview of previous methods yet are processed interactively using our techniques. Finally our system provides a robust and scalable out-of-core solver that consistently offers high-quality solutions while maintaining strict control over system resources.
D. Thompson, J.A. Levine, J.C. Bennett, P.-T. Bremer, A. Gyulassy, V. Pascucci, P.P. Pebay. Analysis of Large-Scale Scalar Data Using Hixels, In Proceedings of the 2011 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV), Providence, RI, pp. 23--30. 2011.
H.T. Vo, J. Bronson, B. Summa, J.L.D. Comba, J. Freire, B. Howe, V. Pascucci, C.T. Silva. Parallel Visualization on Large Clusters using MapReduce, SCI Technical Report, No. UUSCI-2011-002, SCI Institute, University of Utah, 2011.
H.T. Vo, J. Bronson, B. Summa, J.L.D. Comba, J. Freire, B. Howe, V. Pascucci, C.T. Silva. Parallel Visualization on Large Clusters using MapReduce, In Proceedings of the 2011 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV), pp. 81--88. 2011.
Large-scale visualization systems are typically designed to efficiently \"push\" datasets through the graphics hardware. However, exploratory visualization systems are increasingly expected to support scalable data manipulation, restructuring, and querying capabilities in addition to core visualization algorithms. We posit that new emerging abstractions for parallel data processing, in particular computing clouds, can be leveraged to support large-scale data exploration through visualization. In this paper, we take a first step in evaluating the suitability of the MapReduce framework to implement large-scale visualization techniques. MapReduce is a lightweight, scalable, general-purpose parallel data processing framework increasingly popular in the context of cloud computing. Specifically, we implement and evaluate a representative suite of visualization tasks (mesh rendering, isosurface extraction, and mesh simplification) as MapReduce programs, and report quantitative performance results applying these algorithms to realistic datasets. For example, we perform isosurface extraction of up to l6 isovalues for volumes composed of 27 billion voxels, simplification of meshes with 30GBs of data and subsequent rendering with image resolutions up to 800002 pixels. Our results indicate that the parallel scalability, ease of use, ease of access to computing resources, and fault-tolerance of MapReduce offer a promising foundation for a combined data manipulation and data visualization system deployed in a public cloud or a local commodity cluster.
H.T. Vo, C.T. Silva, L.F. Scheidegger, V. Pascucci. Simple and Efficient Mesh Layout with Space-Filling Curves, In Journal of Graphics, GPU, and Game Tools, pp. 25--39. 2011.
Bei Wang, B. Summa, V. Pascucci, M. Vejdemo-Johansson. Branching and Circular Features in High Dimensional Data, SCI Technical Report, No. UUSCI-2011-005, SCI Institute, University of Utah, 2011.
Bei Wang, B. Summa, V. Pascucci, M. Vejdemo-Johansson. Branching and Circular Features in High Dimensional Data, In IEEE Transactions of Visualization and Computer Graphics (TVCG), Vol. 17, No. 12, pp. 1902--1911. 2011.
Large observations and simulations in scientific research give rise to high-dimensional data sets that present many challenges and opportunities in data analysis and visualization. Researchers in application domains such as engineering, computational biology, climate study, imaging and motion capture are faced with the problem of how to discover compact representations of high dimensional data while preserving their intrinsic structure. In many applications, the original data is projected onto low-dimensional space via dimensionality reduction techniques prior to modeling. One problem with this approach is that the projection step in the process can fail to preserve structure in the data that is only apparent in high dimensions. Conversely, such techniques may create structural illusions in the projection, implying structure not present in the original high-dimensional data. Our solution is to utilize topological techniques to recover important structures in high-dimensional data that contains non-trivial topology. Specifically, we are interested in high-dimensional branching structures. We construct local circle-valued coordinate functions to represent such features. Subsequently, we perform dimensionality reduction on the data while ensuring such structures are visually preserved. Additionally, we study the effects of global circular structures on visualizations. Our results reveal never-before-seen structures on real-world data sets from a variety of applications.
M. Berger, L.G. Nonato, V. Pascucci, C.T. Silva. Fiedler Trees for Multiscale Surface Analysis, In Computer & Graphics, Vol. 34, No. 3, Note: Special Issue of Sha, pp. 272--281. June, 2010.
In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the Laplace–Beltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales.
T. Etiene, L.G. Nonato, C.E. Scheidegger, J. Tierny, T.J. Peters, V. Pascucci, R.M. Kirby, C.T. Silva. Topology Verification for Isosurface Extraction, SCI Technical Report, No. UUSCI-2010-003, SCI Institute, University of Utah, 2010.
S. Gerber, P.-T. Bremer, V. Pascucci, R.T. Whitaker. Visual Exploration of High Dimensional Scalar Functions, In IEEE Transactions on Visualization and Computer Graphics, IEEE Transactions on Visualization and Computer Graphics, Vol. 16, No. 6, IEEE, pp. 1271--1280. Nov, 2010.
S. Jadhav, H. Bhatia, P.-T. Bremer, J.A. Levine, L.G. Nonato, V. Pascucci. Consistent Approximation of Local Flow Behavior for 2D Vector Fields using Edge Maps, SCI Technical Report, No. UUSCI-2010-004, SCI Institute, University of Utah, 2010.
S. Kumar, V. Vishwanath, P. Carns, V. Pascucci, R. Latham, T. Peterka, M. Papka, R. Ross. Towards Efficient Access of Multi-dimensional, Multi-resolution Scientific Data, In Proceedings of the 5th Petascale Data Storage Workshop, Supercomputing 2010, pp. (in press). 2010.
J. Tierny, J. Daniels II, L.G. Nonato, V. Pascucci, C.T. Silva. Interactive Quadrangulation with Reeb Atlases and Connectivity Textures, SCI Technical Report, No. UUSCI-2010-006, SCI Institute, University of Utah, 2010.

References: V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V.