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

Workshops Bildverarbeitung fur die Medizin: Algorithmen - Systeme - Anwendungen, BVM 2009 - Workshop on Image Processing for Medicine: Algorithms - Systems - Applications, BVM 2009

作者： Born, Silvia Jainek, Werner Hlawitschka, Mario Scheuermann, Gerik Trantakis, Christos Meixensberger, Jürgen Bartz, Dirk ICCAS / VCM Universität Leipzig Germany Institute for Data Analysis and Visualization University of California Davis United States Institut für Informatik Universität Leipzig Germany Klinik für Neurochirurgie Universitätsklinikum Leipzig Germany

ISBN: (纸本)9783540938590

Designing multimodal visualizations combining anatomical and functional brain data is a demanding task. Jainek et al. [1] applied illustrative rendering techniques to obtain a high-quality representation of the location and characteristic of brain activation areas (derived from MRI and fMRI). Here, we present the integration of DTI data into this system. Reconstructed nerve fibers connecting functional areas with each other and lower brain areas are embedded into the complex rendering pipeline. Further, we enhanced perception of depth and shape by applying silhouettes and dithered halftoning.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Cataclysmic Variables and Other Compact Binaries in the Globular Cluster NGC 362: Candidates from Chandra and HST

引用

AIP Conference Proceedings 2010年第1期1314卷 163-168页

作者： B. Margon B. Beck‐Winchatz L. Homer D. Pooley C. G. Bassa S. F. Anderson W. H. G. Lewin F. Verbunt A. K. H. Kong R. M. Plotkin aDepartment of Astronomy & Astrophysics University of California Santa Cruz CA 95064 USA bScientific Data Analysis and Visualization Program DePaul University Chicago IL 60614 USA cDepartment of Astronomy University of Washington Box 351580 Seattle WA 98195 USA dEureka Scientific 5248 Valley View Road El Sobrante CA 94803 USA eJodrell Bank Centre for Astrophysics School of Physics and Astronomy University of Manchester Manchester M13 9PL UK fKavli Institute for Astrophysics and Space Research Massachusetts Institute of Technology Cambridge MA 02139 USA gAstronomical Institute Utrecht University PO Box 80000 3508 TA Utrecht The Netherlands hInstitute of Astronomy and Department of Physics National Tsing Hua University Hsinchu 30013 Taiwan iAstronomical Institute “Anton Pannekoek ” University of Amsterdam Science Park 904 1098 XH Amsterdam The Netherlands

Highly sensitive and precise X‐ray imaging from Chandra, combined with the superb spatial resolution of HST optical images, dramatically enhances our empirical understanding of compact binaries such as cataclysmic variables and low mass X‐ray binaries, their progeny, and other stellar X‐ray source populations deep into the cores of globular clusters. Our Chandra X‐ray images of the globular cluster NGC 362 reveal 100 X‐ray sources, the bulk of which are likely cluster members. Using HST color‐magnitude and color‐color diagrams, we quantitatively consider the optical content of the NGC 362 Chandra X‐ray error circles, especially to assess and identify the compact binary population in this condensed‐core globular cluster. Despite residual significant crowding in both X‐rays and optical, we identify an excess population of Hα‐emitting objects that is statistically associated with the Chandra X‐ray sources. The X‐ray and optical characteristics suggest that these are mainly cataclysmic variables, but we also identify a candidate quiescent low mass X‐ray binary. A potentially interesting and largely unanticipated use of observations such as these may be to help constrain the macroscopic dynamic state of globular clusters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Interactive assembly of molecular structures

Interactive assembly of molecular structures

引用

5th Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2008

作者： Kreylos, Oliver W. M. Keck Center for Active Visualization in Earth Sciences Institute for Data Analysis and Visualization University of California Davis United States

来源：评论

学校读者我要写书评

暂无评论

Automatic beam path analysis of laser wakefield particle acceleration data

引用

Computational Science and Discovery 2009年第1期2卷

作者： Rübel, Oliver Geddes, Cameron G R. Cormier-Michel, Estelle Wu, Kesheng Prabhat Weber, Gunther H. Ushizima, Daniela M. Messmer, Peter Hagen, Hans Hamann, Bernd Bethel, Wes Computational Research Division Lawrence Berkeley National Laboratory Berkeley CA 94720 One Cyclotron Road United States 'Visualization of Large and Unstructured Data Sets - Applic. in Geospatial Plan. Modeling and Eng. 'Technische Universität Kaiserslautern D-67653 Kaiserslautern Erwin-Schrödinger-Straße Germany Institute for Data Analysis and Visualization (IDAV) Department of Computer Science University of California Davis CA 95616 Davis One Shields Avenue United States LOASIS Program of Lawrence Berkeley National Laboratory Berkeley CA 94720 One Cyclotron Road United States Tech-X Corporation Boulder CO 80303 5621 Arapahoe Avenue United States

Numerical simulations of laser wakefield particle accelerators play a key role in the understanding of the complex acceleration process and in the design of expensive experimental facilities. As the size and complexity of simulation output grows, an increasingly acute challenge is the practical need for computational techniques that aid in scientific knowledge discovery. To that end, we present a set of data-understanding algorithms that work in concert in a pipeline fashion to automatically locate and analyze high-energy particle bunches undergoing acceleration in very large simulation datasets. These techniques work cooperatively by first identifying features of interest in individual timesteps, then integrating features across timesteps, and based on the information-derived perform analysis of temporally dynamic features. This combination of techniques supports accurate detection of particle beams enabling a deeper level of scientific understanding of physical phenomena than has been possible before. By combining efficient data analysis algorithms and state-of-the-art data management we enable high-performance analysis of extremely large particle datasets in 3D. We demonstrate the usefulness of our methods for a variety of 2D and 3D datasets and discuss the performance of our analysis pipeline. © 2009 IOP Publishing Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Crystal Structures Classifier for an Evolutionary Algorithm Structure Predictor

Crystal Structures Classifier for an Evolutionary Algorithm ...

引用

IEEE Symposium on Visual Analytics Science and Technology

作者： Valle, Mario Oganov, Artem R. Data Analysis and Visualization Services Swiss National Supercomputing Centre (CSCS) Switzerland Laboratory of Crystallography Department of Materials ETH Zürich Switzerland

ISBN: (纸本)9781424429356

USPEX is a crystal structure predictor based on an evolutionary algorithm. Every USPEX run produces hundreds or thousands of crystal structures, some of which may be identical. To case the extraction of unique and potentially interesting structures we applied usual high-dimensional classification concepts to the unusual field of crystallography. We experimented with various crystal structure descriptors, distinct distance measures and tried different clustering methods to identify groups of similar structures. These methods are already applied in combinatorial chemistry to organic molecules for a different coal and in somewhat different forms, but are not widely used for crystal structures classification. We adopted a visual design and validation method in the development of a library (CrystalFp) and an end-user application to select and validate method choices, to gain users' acceptance and to tap into their domain expertise. The use of the classifier has already accelerated the analysis of USPEX output by at least one order of magnitude, promoting some new crystallographic insight and discovery. Furthermore the Visual display of key algorithm indicators has led to diverse, unexpected discoveries that will improve the USPEX algorithms.

关键词： J.2 [Physical Sciences and Engineering]: Chemistry 1.5.2 [Pattern Recognition]: Design Methodology-Classifier design and evaluation

来源：评论

学校读者我要写书评

暂无评论

Generation of accurate integral surfaces in time-dependent vector fields

Generation of accurate integral surfaces in time-dependent v...

引用

作者： Garth, Christoph Krishnan, Hari Tricoche, Xavier Bobach, Tom Joy, Kenneth I. Institute of Data Analysis and Visualization University of California Davis United States Computer Science Dept. Purdue University Geometric Algorithms Group University of Kaiserslautern

We present a novel approach for the direct computation of integral surfaces in time-dependent vector fields. As opposed to previous work, which we analyze in detail, our approach is based on a separation of integral surface computation into two stages: surface approximation and generation of a graphical representation. This allows us to overcome several limitations of existing techniques. We first describe an algorithm for surface integration that approximates a series of time lines using iterative refinement and computes a skeleton of the integral surface. In a second step, we generate a well-conditioned triangulation. Our approach allows a highly accurate treatment of very large time-varying vector fields in an efficient, streaming fashion. We examine the properties of the presented methods on several example datasets and perform a numerical study of its correctness and accuracy. Finally, we investigate some visualization aspects of integral surfaces. © 2008 IEEE.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

3D imaging of cerebral aneurysms: Comparison between CT and MRI

3D imaging of cerebral aneurysms: Comparison between CT and ...

引用

Workshops Bildverarbeitung fur die Medizin: Algorithmen - Systeme - Anwendungen, BVM 2008 - Workshop on Image Processing for Medicine: Algorithms - Systems - Applications, BVM 2008

作者： Goubergrits, Leonid Pöthke, Jens Petz, Christoph Hege, Hans-Christian Spuler, Andreas Kertzscher, Ulrich Labor für Biofluidmechanik Charité-Universitätsmedizin Berlin Germany Visualization and Data Analysis Konrad Zuse Institute Berlin Germany Neurochirurgie Helios Klinikum Berlin-Buch Germany

来源：评论

学校读者我要写书评

暂无评论

Why interval arithmetic is so useful

Why interval arithmetic is so useful

引用

2nd Workshop of the DFG's International Research Training Group on visualization of Large and Unstructured data Sets - Applications in Geospatial Planning, Modeling, and Engineering, VLUDS 2007

作者： Hijazi, Younis Hagen, Hans Hansen, Charles Joy, Kenneth I. Department of Computer Sciences University of Kaiserslautern and IRTG 1131 D-67653 Kaiserslautern Germany SCI Institute University of Utah United States Computer Science Department Institute for Data Analysis and Visualization University of California Davis United States

ISBN: (纸本)9783885794417

Interval arithmetic was introduced by Ramon Moore [Moo66] in the 1960s as an approach to bound rounding errors in mathematical computation. The theory of interval analysis emerged considering the computation of both the exact solution and the error term as a single entity, i.e. the interval. Though a simple idea, it is a very powerful technique with numerous applications in mathematics, computer science, and engineering. In this survey we discuss the basic concepts of interval arithmetic and some of its extensions, and review successful applications of this theory in particular in computer science.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：