检索结果-内蒙古大学图书馆

2nd Eurographics Workshop on Visualcomputing in Biology and Medicine, EG VCBM 2010

作者： Leymarie, Frederic Fol Chang, Ming-Ching Imielinska, Celina Kimia, Benjamin B. Computing Dept. Goldsmiths College University of London United Kingdom Visualization and Computer Vision Lab. General Electric Global Research Center Niskayuna NY United States Department of Biomedical Informatics Columbia University United States Division of Engineering Brown University United States

ISBN: (纸本)9783905674286

We present the latest developments in modeling 3D biomedical data via the Medial Scaffold (MS), a 3D acyclic oriented graph representation of the Medial Axis (MA) [LK07, SP08]. TheMS (and associated 3DMA) can be computed as the result of the singularities of a geometric wave propagation simulation. We consider here some of the potential applications of this shape model in the realm of biomedical imaging. We can reconstruct complex object surfaces and make explicit the coarse-scale structures, which are ready-to-use in a number of practical applications, including: morphological measurement for cortex or bone thickness, centerline extraction (curve skeleton) for tracheotomy or colonoscopy, surface partitioning for cortical or anatomical surface classification, as well as registration and matching of shapes of tumors or carpal bones. TheMS permits to automatically and efficiently map an unorganised point cloud, i.e., simple 3D coordinates of point samples, to a coherent surface set and associated approximateMA. The derivedMS is used to further recover significant medium and large scale features, such as surface ridges and main axial symmetries. The radius field of theMS provides an intuitive definition for morphological measurements, while the graph structure made explicit by theMS is useful for shape registration and matching applications. © The Eurographics Association 2010.

关键词： Wave propagation

来源：评论

学校读者我要写书评

暂无评论

Fast estimation of the vascular cooling in RFA based on numerical simulation

引用

Open Biomedical Engineering Journal 2010年第SPEC. ISSUE 1期4卷 16-26页

作者： Kröger, T. Pätz, T. Altrogge, I. Schenk, A. Lehmann, K.S. Frericks, B.B. Ritz, J.-P. Peitgen, H.-O. Preusser, T. Fraunhofer MEVIS Institute for Medical Image Computing Bremen Germany CeVis Center of Complex Systems and Visualization University of Bremen Germany Chirurgische Klinik I Charité - Campus Benjamin Franklin Berlin Germany Jacobs University Bremen Germany

We present a novel technique to predict the outcome of an RF ablation, including the vascular cooling effect. The main idea is to separate the problem into a patient independent part, which has to be performed only once for every applicator model and generator setting, and a patient dependent part, which can be performed very fast. The patient independent part fills a look-up table of the cooling effects of blood vessels, depending on the vessel radius and the distance of the RF applicator from the vessel, using a numerical simulation of the ablation process. The patient dependent part, on the other hand, only consists of a number of table look-up processes. The paper presents this main idea, along with the required steps for its implementation. First results of the computation and the related ex-vivo evaluation are presented and discussed. The paper concludes with future extensions and improvements of the approach. © Kröger et al.

关键词： Cooling

来源：评论

学校读者我要写书评

暂无评论

Multi-application inter-tile synchronization on ultra-high-resolution display walls 10

Multi-application inter-tile synchronization on ultra-high-r...

引用

2010 ACM SIGMM Conference on Multimedia Systems, MMSys'10

作者： Nam, Sungwon Deshpande, Sachin Vishwanath, Venkatram Jeong, Byungil Renambot, Luc Leigh, Jason Electronic Visualization Laboratory 842 W. Taylor St. Chicago IL 60607 United States Sharp Laboratories of America 5750 NW Pacific Rim Blvd. Camas WA 98607 United States Argonne National Laboratory 9700 S. Cass Ave. Argonne IL 60439 United States Texas Advanced Computing Center Bldg. 196 10100 Burnet Rd. Austin TX 78758 United States

ISBN: (纸本)9781605589145

Ultra-high-resolution tiled-display walls are typically driven by a cluster of computers. Each computer may drive one or more displays. Synchronization between the computers is necessary to ensure that animated imagery displayed on the wall appears seamless. Most tiled-display middleware systems are designed around the assumption that only a single application instance is running in the tiled display at a time. Therefore synchronization can be achieved with a simple solution such as a networked barrier. When a tiled display has to support multiple applications at the same time, however, the simple networked barrier approach does not scale. In this paper we propose and experimentally validate two synchronization algorithms to achieve low-latency, intertile synchronization for multiple applications with independently varying frame rates. The two-phase algorithm is more generally applicable to various highresolution tiled display systems. The one-phase algorithm provides superior results but requires support for the Network Time Protocol and is more CPU-intensive. Copyright 2010 ACM.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive meshing and detail-reduction of 3D-point clouds from laser scans 3

Adaptive meshing and detail-reduction of 3D-point clouds fro...

引用

3rd ISPRS International Workshop on 3D Virtual Reconstruction and visualization of Complex Architectures, 3D-ARCH 2009

作者： Hoppe, Christoph Krömker, Susanne Interdisciplinary Center for Scientific Computing Numerical Geometry and Visualization Group University of Heidelberg INF 368 Heidelberg69120 Germany

3D laser scanners become more and more popular especially for measuring construction sites, in the field of architecture and for preservation of monuments. As these scanners can only record discrete data sets (point clouds), it is necessary to mesh these sets for getting closed 3D models and take advantage of 3D graphics acceleration of modern graphics hardware. The meshing process is a complex issue and in the last years there were lots of algorithms developed to solve this problem. In this work a continuous Level-of-Detail (LOD) algorithm will be presented, from which a simplified 3D surface model can be created, which uses only as much triangles as needed. The grade of simplification is user-defined by an error tolerance similar to the Hausdorff distance. This algorithm is not a dynamic (view-dependent) LOD mesh simplification, but a non-redundant approximation of point clouds. It is a simple and extendable meshing algorithm, which is made up of a mixture of some techniques adapted from popular terrain LOD algorithms. The algorithm has been implemented in an OpenGL based editing tool for 3D point clouds called PointMesh, which will be explained in detail. We present examples from an excavation site (church rest of Lorsch Abbey, Germany), the inner part of the Heidelberg Tun (German: Großes Fass, an extremely large wine vat) and the Old Bridge gate, Heidelberg. For different cut-outs a performance comparison of the regular mesh to various adaptive 4-8-meshes with different error tolerances is given in terms of frame rates.

关键词： Scanning

来源：评论

学校读者我要写书评

暂无评论

A security framework for dynamic collaborative working environments

引用

Identity in the Information Society 2009年第2期2卷 171-187页

作者： Matthias Assel Stefan Wesner Alexander Kipp Intelligent Service Infrastructures High Performance Computing Center Stuttgart Stuttgart Germany Applications & Visualization High Performance Computing Center Stuttgart Stuttgart Germany

Moving away from simple data sharing within the science community towards cross-organizational collaboration scenarios significantly increased challenges related to security and privacy. They need to be addressed in order to make cross-organizational applications such as collaborative working environments a business proposition within communities such as eHealth, construction or manufacturing. Increasingly distributed scenarios where many different types of services need to be combined in order to implement semantically enriched business processes demand new approaches to security within such dynamic Virtual Organizations. The allocation of access rights need to be possible in an easy and controlled way in order to allow inexperienced users to maintain the information and ensure compliance e.g. with legal and privacy related regulations. In this paper the focus is how security concepts originating from the Grid domain have been applied for collaborative working environments. The chosen scenarios are a Virtual Laboratory for Infectious Diseases (ViroLab) and different collaborative environments from the engineering domain as defined within the CoSpaces project. The requirements from these scenarios are analyzed and a security model enabling such dynamic, secure and trustworthy collaborations is presented.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GPU Based Optical Character Transcription for Ancient Inscription Recognition

GPU Based Optical Character Transcription for Ancient Inscri...

引用

International Conference on Virtual Systems and MultiMedia

作者： Hubert Mara Jan Hering Susanne Kromker Interdisciplinary Center of Scientific Computing Visualization and Numerical Geometry Group Heidelberg University Heidelberg Germany

ISBN: (纸本)9781424448340

Motivated by the challenging questions of todays sinologists we are developing an automated system for processing of ancient Chinese inscriptions (sutras). As these inscriptions are not accessible due to location or damage our input data are noisy images of paper showing the texture of stones together with the inscriptions transfered by charcoal or pencil. Due to the vast amount and large sizes of the images we adopted highly parallelized - and therefore high-performance -- anisotropic filtering using standard computer hardware. Additionally characters are localized/segmented for further processing by optical character recognition. Real results for ancient Chinese inscriptions, which are mimicking non-standardized handwritings are shown.

关键词： Character recognition Optical character recognition software Optical filters Writing Image processing Geometrical optics Anisotropic filters Hardware Testing Documentation

来源：评论

学校读者我要写书评

暂无评论

Two-stage framework for visualization of clustered high dimensional data

Two-stage framework for visualization of clustered high dime...

引用

VAST 09 - IEEE Symposium on Visual Analytics Science and Technology

作者： Choo, Jaegul Bohn, Shawn Park, Haesun College of Computing Georgia Institute of Technology 266 Ferst Drive Atlanta GA 30332 United States National Visualization and Analytics Center Pacific Northwest National Laboratory 902 Battelle Blvd Richland WA 99354 United States

ISBN: (纸本)9781424452835

In this paper, we discuss dimension reduction methods for 2D visualization of high dimensional clustered data. We propose a two-stage framework for visualizing such data based on dimension reduction methods. In the first stage, we obtain the reduced dimensional data by applying a supervised dimension reduction method such as linear discriminant analysis which preserves the original cluster structure in terms of its criteria. The resulting optimal reduced dimension depends on the optimization criteria and is often larger than 2. In the second stage, the dimension is further reduced to 2 for visualization purposes by another dimension reduction method such as principal component analysis. The role of the second-stage is to minimize the loss of information due to reducing the dimension all the way to 2. Using this framework, we propose several two-stage methods, and present their theoretical characteristics as well as experimental comparisons on both artificial and real-world text data sets. ©2009 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Maximizing adaptivity in hierarchical topological models using cancellation trees

Maximizing adaptivity in hierarchical topological models usi...

引用

Workshop on Mathematical Foundations of Scientific visualization, Computer Graphics, and Massive Data Exploration, 2004

作者： Bremer, Peer-Timo Pascucci, Valerio Hamann, Bernd Department of Computer Science University of Illinois Urbana-Champaign United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Institute for Data Analysis and Visualization Department of Computer Science University of California Davis United States

ISBN: (纸本)9783642543005

We present a highly adaptive hierarchical representation of the topology of functions defined over two-manifold domains. Guided by the theory of Morse–Smale complexes, we encode dependencies between cancellations of critical points using two independent structures: a traditional mesh hierarchy to store connectivity information and a new structure called cancellation trees to encode the configuration of critical points. Cancellation trees provide a powerful method to increase adaptivity while using a simple, easy-to-implement data structure. The resulting hierarchy is significantly more flexible than the one previously reported (IEEE Trans. Vis. Comput. Graph. 10(4):385–396, 2004). In particular, the resulting hierarchy is guaranteed to be of logarithmic height. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Remote visualization of large scale data for ultra-high resolution display environments

Remote visualization of large scale data for ultra-high reso...

引用

2009 Workshop on Ultrascale visualization, UltraVis '09

作者： Nam, Sungwon Jeong, Byungil Renambot, Luc Johnson, Andrew Gaither, Kelly Leigh, Jason Electronic Visualization Laboratory University of Illinois at Chicago 842 W. Taylor St. Chicago IL 60607 United States Texas Advanced Computing Center 10100 Burnet Rd. Bldg 196 Austin TX 78758 United States

ISBN: (纸本)9781605588971

ParaView is one of the most widely used scientific tools that support parallel visualization of large scale data. The Scalable Adaptive Graphics Environment (SAGE) is a graphics middleware that enables real-time streaming of ultra-high resolution visual content from distributed visualization resources to scalable tiled displays connected by ultra-high-speed networks. Integrating these two technologies enables visualization of large-scale data at an extremely high resolution to be displayed on distantly located scalable tiled displays. The benefits, limitations, and future directions for this approach will be discussed. Copyright 2009 ACM.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Compression and occlusion culling for fast isosurface extraction from massive datasets

Compression and occlusion culling for fast isosurface extrac...

引用

Workshop on Mathematical Foundations of Scientific visualization, Computer Graphics, and Massive Data Exploration, 2004

作者： Gregorski, Benjamin Senecal, Joshua Duchaineau, Mark Joy, Kenneth I. Center for Applied Scientific Computing Lawrence Livermore National Laboratory 7000 East Avenue LivermoreCA94551 United States Institute for Data Analysis and Visualization Department of Computer Science University of California Davis One Shields Avenue DavisCA95616 United States

ISBN: (纸本)9783642543005

We present two algorithms for data compression and occlusion culling that improve interactive, adaptive isosurface extraction from large volume datasets. Our algorithm, based on hierarchical tetrahedral meshes defined by longest edge bisection, allows arbitrary isosurfaces to be adaptively extracted at interactive rates from losslessly compressed volumes where the region of interest, determined at runtime by user interaction, is decompressed on-the-fly. For interactive applications, we exploit frame-to-frame coherence between consecutive views to simplify the mesh structure in occluded regions and eliminate occluded triangles significantly reducing the complexity of the visualized surface and the underlying multiresolution volume representation. We extend the use of hardware accelerated occlusion queries to adaptive isosurface extraction applications where the surface geometry and topology change with the level-of-detail and view-point and the user can select an arbitrary isovalue for visualization. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：