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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

179 篇 会议
156 篇 期刊文献

馆藏范围

335 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

198 篇 工学
- 144 篇 计算机科学与技术...
- 131 篇 软件工程
- 34 篇 光学工程
- 34 篇 生物工程
- 32 篇 信息与通信工程
- 22 篇 生物医学工程（可授...
- 17 篇 控制科学与工程
- 12 篇 机械工程
- 12 篇 电气工程
- 11 篇 化学工程与技术
- 10 篇 电子科学与技术（可...
- 8 篇 土木工程
- 6 篇 建筑学
- 5 篇 仪器科学与技术
- 5 篇 安全科学与工程
- 4 篇 力学（可授工学、理...
- 4 篇 材料科学与工程（可...
112 篇 理学
- 49 篇 数学
- 40 篇 生物学
- 39 篇 物理学
- 19 篇 统计学（可授理学、...
- 12 篇 化学
- 8 篇 系统科学
32 篇 管理学
- 16 篇 管理科学与工程(可...
- 16 篇 图书情报与档案管...
- 7 篇 工商管理
18 篇 医学
- 17 篇 基础医学(可授医学...
- 17 篇 临床医学
- 12 篇 药学(可授医学、理...
6 篇 法学
- 6 篇 社会学
3 篇 经济学
3 篇 农学
1 篇 文学

主题

32 篇 computer science
24 篇 rendering (compu...
22 篇 computer graphic...
15 篇 visualization
14 篇 computational mo...
14 篇 semantics
11 篇 hardware
11 篇 image reconstruc...
10 篇 acceleration
10 篇 solid modeling
9 篇 computed tomogra...
9 篇 volume rendering
9 篇 computer vision
8 篇 three-dimensiona...
7 篇 benchmarking
6 篇 casting
6 篇 deep learning
6 篇 pixel
6 篇 data mining
6 篇 sampling methods

机构

31 篇 shanghai collabo...
19 篇 shanghai collabo...
19 篇 school of comput...
18 篇 school of comput...
11 篇 shanghai key lab...
9 篇 institute of mod...
9 篇 center for visua...
8 篇 center for visua...
8 篇 shenzhen key lab...
8 篇 academy for engi...
8 篇 center for visua...
7 篇 inst. for artifi...
7 篇 shanghai key lab...
7 篇 center on fronti...
7 篇 bio-computing re...
6 篇 shanghai collabo...
6 篇 peng cheng labor...
6 篇 institute for ar...
6 篇 center for visua...
5 篇 center for visua...

作者

32 篇 jiang yu-gang
31 篇 a. kaufman
18 篇 mueller klaus
18 篇 wu zuxuan
15 篇 chen jingjing
14 篇 k. mueller
13 篇 feng rui
12 篇 arie kaufman
12 篇 wang yizhou
12 篇 zhang yuejie
11 篇 chen zhineng
11 篇 yu-gang jiang
11 篇 yan bo
11 篇 tan weimin
10 篇 xu yong
10 篇 ming wan
10 篇 zhang qi
9 篇 huang xuanjing
8 篇 cheng ying
7 篇 wei li

语言

310 篇 英文
23 篇 其他
2 篇 中文

检索条件"机构=Computer Science Center for Visual Computing"

共 335 条记录，以下是281-290 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Feature preserving distance fields

Feature preserving distance fields

引用

IEEE Symposium on Volume visualization and Graphics

作者： Huamin Qu Nan Zhang Ran Shao A. Kaufman K. Mueller Center for Visual Computing and Department of Computer Science Stony Brook University Stony Brook NY USA

ISBN: (纸本)0780387813

We present two distance field representations which can preserve sharp features in original geometric models: the offset distance field (ODF) and the unified distance field (UDF). The ODF is sampled on a special curvilinear grid named an offset grid. The sample points of the ODF are not on a regular grid and they can float in the cells of a regular base grid. The ODF can naturally adapt to curvature variations in the original mesh and can preserve sharp features. We describe an energy minimization approach to convert geometric models to ODFs. The UDF integrates multiple distance field representations into one data structure. By adaptively using different representations for different parts of a shape, the UDF can provide high fidelity surface representation with compact storage and fast rendering speed.

关键词： Sampling methods Surface reconstruction Solid modeling computer science Data structures computer graphics Radio access networks Rendering (computer graphics) Chromium Computational geometry

来源：评论

学校读者我要写书评

暂无评论

SHIC: a view-dependent rendering framework for isosurfaces

SHIC: a view-dependent rendering framework for isosurfaces

引用

IEEE Symposium on Volume visualization and Graphics

作者： Nan Zhang Huamin Qu Wei Hong A. Kaufman Center for Visual Computing (CVC) and Department of Computer Science Stony Brook University Stony Brook NY USA

ISBN: (纸本)0780387813

We present selective and hierarchical isopoint clustering (SHIC) as a framework for interactive isosurface visualization. SHIC is an octree-based vertex hierarchy where each surface component in a cell is represented by a vertex (isopoint) with encoded connectivity. We describe a novel connectivity encoding scheme, called connectivity encoding bitmap, and two topology-preserving isopoint clustering algorithms to build the vertex hierarchy. Our framework is able to cluster surface components with up to four intersection points on a cell edge. During rendering, an incremental isosurface extraction algorithm is used to construct the isosurface dynamically. Events associated with vertex tree modifications and active vertices changes are unified using timestamps. Our framework is efficient, space-saving, and suitable for rendering large isosurface objects with local modifications.

关键词： Isosurfaces Clustering algorithms Rendering (computer graphics) visualization Encoding computer science Tree graphs Chromium computer graphics Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Range image registration via probability field

Range image registration via probability field

引用

computer Graphics International

作者： H. Zhang O. Hall-Holt A. Kaufman Center for Visual Computing (CVC) Computer Science Department Stony Brook University Stony Brook NY USA Center for Visual Computing (CVC) Department of Applied Mathematics and Statistics Stony Brook University Stony Brook NY USA

This paper presents a powerful variant of the ICP (iterative closest point) algorithm for registering range images using a probability field. The probability field (p-field) represents the probability distribution of the surface position. By capitalizing on the properties of the range image, fast construction, compact representation, and efficient query of the p-field can be achieved. Different sensor models are supported by the p-field according to the properties of the range image. Range images can be precisely aligned by maximizing the probability of overlapping surfaces via the p-field

关键词： Image registration Iterative closest point algorithm Iterative algorithms Image reconstruction Iterative methods computer science Mathematics Statistical distributions Probability distribution Image sensors

来源：评论

学校读者我要写书评

暂无评论

Volumetric ablation rendering

Volumetric ablation rendering

引用

Volume Graphics 2003, Third Intenational Workshop on Volume Graphics

作者： Varadhan, Hari Mueller, Klaus Center for Visual Computing Computer Science Stony Brook University United States

ISBN: (纸本)1581137451

In this paper, we propose a physically-based method for simulating the process of ablation on volumetric models. We demonstrate the visual effect of ablative processes, such as a beam of heat emitted from a blow torch or a pencil of sand expelled from a sandblaster. Users are able to control ablative properties, such as energy propagation, absorption, and material evaporation, via a simple transfer function interface, while the effect of different beam shapes can be modeled by ways of weighting functions. Continuous evaporation of material to expose interior object features can eliminate smooth object boundary layers required for good gradient estimation. To prevent this adverse effect, our method leaves the original volume intact and instead operates on a smooth energy volume. The renderer then uses the energy volume to determine the current, smooth object boundaries, for the opacity and gradient calculations, while the original volume provides the visual material properties, such as color and shading coefficients.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

Volumetric ablation rendering 03

Volumetric ablation rendering

引用

2003 Eurographics/IEEE TVCG Workshop on Volume Graphics, VG '03

作者： Varadhan, Hari Mueller, Klaus Center for Visual Computing Computer Science Stony Brook University United States

ISBN: (纸本)1581137451

In this paper, we propose a physically-based method for simulating the process of ablation on volumetric models. We demonstrate the visual effect of ablative processes, such as a beam of heat emitted from a blow torch or a pencil of sand expelled from a sandblaster. Users are able to control ablative properties, such as energy propagation, absorption, and material evaporation, via a simple transfer function interface, while the effect of different beam shapes can be modeled by ways of weighting *** evaporation of material to expose interior object features can eliminate smooth object boundary layers required for good gradient estimation. To prevent this adverse effect, our method leaves the original volume intact and instead operates on a smooth energy volume. The renderer then uses the energy volume to determine the current, smooth object boundaries, for the opacity and gradient calculations, while the original volume provides the visual material properties, such as color and shading coefficients. © The Eurographics Association 2003.

关键词： Evaporation

来源：评论

学校读者我要写书评

暂无评论

Post-convolved splatting

Post-convolved splatting

引用

5th Joint Eurographics - IEEE TCVG Symposium on visualization, VisSym 2003

作者： Neophytou, Neophytos Mueller, Klaus Center for Visual Computing Computer Science Stony Brook University Stony BrookNY11794 United States

ISBN: (纸本)3905673010

One of the most expensive operations in volume rendering is the interpolation of samples in volume space. The number of samples, in turn, depends on the resolution of the final image. Hence, viewing the volume at high magnification will incur heavy computation. In this paper, we explore an approach that limits the number of samples to the resolution of the volume, independent of the magnification factor, using a cheap post-convolution process on the interpolated samples to generate the missing samples. For X-ray, this post-convolution is needed only once, after the volume is fully projected, while in full volume rendering, the post-convolution must be applied before each shading and compositing step. Using this technique, we are able to achieve speedups of two and more, without compromising rendering quality. We demonstrate our approach using an image-aligned sheet-buffered splatting algorithm, but our conclusions readily generalize to any volume rendering algorithm that advances across the volume in a slice-based fashion. © 2003 Eurographics Association. All rights reserved.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

Interactive transfer function modification for volume rendering using compressed sample runs

Interactive transfer function modification for volume render...

引用

computer Graphics International

作者： Vivek Srivastava Uday Chebrolu K. Mueller Center for Visual Computing Center for Visual Computing USA Center for Visual Computing Computer Science Stony Brook University USA Computer Science Stony Brook University

We describe a software-based method for interactive transfer function modification. Our approach exploits the fact that, in general, a user will rarely want to modify the viewpoint and the transfer functions at the same time. In that spirit, we optimize the latter by first fixing the viewpoint and then storing a compressed list of samples along each ray. Then, each time the transfer function is modified, the algorithm traverses the compressed sample lists, decompressing the runs and compositing the newly colored samples along each ray until full opacity is reached. Since the expensive sample interpolation and shading is no longer necessary, we can obtain near-interactive framerates for a variety of datasets, while our RLE-based compression of linearly varying sample runs helps keep the storage complexity down, with little decompression overhead. Decompression cost is reduced by storing decompression results in an on-the-fly constructed 2D table.

关键词： Transfer functions Polynomials Rendering (computer graphics) Interpolation Hardware Fourier transforms computer science computer graphics Light sources Cache storage

来源：评论

学校读者我要写书评

暂无评论

A frequency-sensitive point hierarchy for images and volumes

A frequency-sensitive point hierarchy for images and volumes

引用

IEEE Conference on visualization

作者： T. Welsh K. Mueller Center for Visual Computing Computer Science Stony Brook University USA

This paper introduces a method for converting an image or volume sampled on a regular grid into a space-efficient irregular point hierarchy. The conversion process retains the original frequency characteristics of the dataset by matching the spatial distribution of sample points with the required frequency. To achieve good blending, the spherical points commonly used in volume rendering are generalized to ellipsoidal point primitives. A family of multiresolution, oriented Gabor wavelets provide the frequency-space analysis of the dataset. The outcome of this frequency analysis is the reduced set of points, in which the sampling rate is decreased in originally oversampled areas. During rendering, the traversal of the hierarchy can be controlled by any suitable error metric or quality criteria. The local level of refinement is also sensitive to the transfer function. Areas with density ranges mapped to high transfer function variability are rendered at higher point resolution than others. Our decomposition is flexible and can be used for iso-surface rendering, alpha compositing and X-ray rendering of volumes. We demonstrate our hierarchy with an interactive splatting volume renderer, in which the traversal of the point hierarchy for rendering is modulated by a user-specified frame rate.

关键词： Frequency Rendering (computer graphics) Image sampling Transfer functions Root mean square Discrete wavelet transforms computer science Engines computer errors USA Councils

来源：评论

学校读者我要写书评

暂无评论

Voxels on fire [computer animation]

Voxels on fire [computer animation]

引用

IEEE Conference on visualization

作者： Ye Zhao Xiaoming Wei Zhe Fan A. Kaufman Hong Qin Center for Visual Computing and Department of Computer Science Stony Brook University Stony Brook NY USA

We introduce a method for the animation of fire propagation and the burning consumption of objects represented as volumetric data sets. Our method uses a volumetric fire propagation model based on an enhanced distance field. It can simulate the spreading of multiple fire fronts over a specified isosurface without actually having to create that isosurface. The distance field is generated from a specific shell volume that rapidly creates narrow spatial bands around the virtual surface of any given isovalue. The complete distance field is then obtained by propagation from the initial bands. At each step multiple fire fronts can evolve simultaneously on the volumetric object. The flames of the fire are constructed from streams of particles whose movement is regulated by a velocity field generated with the hardware-accelerated Lattice Boltzmann Model (LBM). The LBM provides a physically-based simulation of the air flow around the burning object. The object voxels and the splats associated with the flame particles are rendered in the same pipeline so that the volume data with its external and internal structures can be displayed along with the fire.

关键词： Fires Computational modeling Lattice Boltzmann methods computer graphics visualization Animation Isosurfaces Fuels computer science Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Piecewise C/sup 1/ continuous surface reconstruction of noisy point clouds via local implicit quadric regression

Piecewise C/sup 1/ continuous surface reconstruction of nois...

引用

IEEE Conference on visualization

作者： Hui Xie Jianning Wang Jing Hua Hong Qin A. Kaufman Center for Visual Computing (CVC) and Department of Computer Science Stony Brook University Stony Brook NY USA

This paper addresses the problem of surface reconstruction of highly noisy point clouds. The surfaces to be reconstructed are assumed to be 2-manifolds of piecewise C/sup 1/ continuity, with isolated small irregular regions of high curvature, sophisticated local topology or abrupt burst of noise. At each sample point, a quadric field is locally fitted via a modified moving least squares method. These locally fitted quadric fields are then blended together to produce a pseudo-signed distance field using Shepard's method. We introduce a prioritized front growing scheme in the process of local quadrics fitting. Flatter surface areas tend to grow faster. The already fitted regions will subsequently guide the fitting of those irregular regions in their neighborhood.

关键词： Surface reconstruction Clouds Image reconstruction Sampling methods Surface fitting computer graphics Least squares methods computer vision computer science Chromium

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共34页 << < 25 26 27 28 29 30 31 32 33 34 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：