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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

649 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

350 篇 工学
- 269 篇 软件工程
- 235 篇 计算机科学与技术...
- 108 篇 信息与通信工程
- 90 篇 电气工程
- 29 篇 光学工程
- 20 篇 控制科学与工程
- 17 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 15 篇 机械工程
- 10 篇 土木工程
- 9 篇 电子科学与技术（可...
- 8 篇 建筑学
- 5 篇 材料科学与工程（可...
- 5 篇 测绘科学与技术
- 4 篇 生物工程
149 篇 医学
- 147 篇 临床医学
- 7 篇 基础医学(可授医学...
- 7 篇 药学(可授医学、理...
- 6 篇 特种医学
69 篇 理学
- 40 篇 数学
- 34 篇 物理学
- 8 篇 统计学（可授理学、...
- 6 篇 化学
- 5 篇 生物学
- 4 篇 地球物理学
- 3 篇 地理学
18 篇 管理学
- 14 篇 管理科学与工程(可...
- 6 篇 图书情报与档案管...
- 5 篇 工商管理
3 篇 法学
- 3 篇 社会学
2 篇 农学
1 篇 经济学

主题

81 篇 data visualizati...
74 篇 cameras
74 篇 layout
73 篇 image reconstruc...
72 篇 shape
45 篇 humans
43 篇 data mining
43 篇 solid modeling
39 篇 robustness
39 篇 surface reconstr...
37 篇 computer science
36 篇 data processing
35 篇 computer vision
31 篇 geometry
28 篇 application soft...
28 篇 image segmentati...
27 篇 visualization
25 篇 computer graphic...
21 篇 laboratories
21 篇 image processing

机构

6 篇 informatics and ...
5 篇 department of co...
4 篇 information proc...
4 篇 national laborat...
3 篇 comp & automat r...
3 篇 department of in...
2 篇 fraunhofer ipsi ...
2 篇 brown university...
2 篇 inria rhone alpe...
2 篇 department of co...
2 篇 univ verona dipa...
2 篇 department of co...
2 篇 philips research...
2 篇 state grid fujia...
2 篇 school of mechat...
2 篇 zentrum fur grap...
2 篇 national laborat...
2 篇 fraunhofer insti...
2 篇 univ alberta dep...
2 篇 fox-miire resear...

作者

7 篇 m.g. strintzis
5 篇 strintzis mg
4 篇 d. tzovaras
4 篇 pollefeys marc
4 篇 g.m. cortelazzo
4 篇 l. van gool
3 篇 i. cheng
3 篇 s. malassiotis
3 篇 van gool luc
3 篇 pu jiantao
3 篇 cheng irene
3 篇 ansary tarik fil...
3 篇 matula p
3 篇 luc van gool
3 篇 m. kozubek
3 篇 hongbin zha
3 篇 t. matsuyama
3 篇 kozubek m
3 篇 daoudi mohamed
3 篇 p. daras

语言

652 篇 英文
2 篇 中文
1 篇 其他

检索条件"任意字段=3rd International Symposium on 3D Data Processing, Visualization and Transmission"

共 655 条记录，以下是361-370 订阅

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

详细简洁

排序：

3d shape registration using regularized medial scaffolds

3D shape registration using regularized medial scaffolds

引用

Proceedings - 2nd international symposium on 3d data processing, visualization, and transmission. 3dPVT 2004

作者： Chang, Ming-Ching Leymarie, Frederic F. Kimia, Benjamin B. LEMS Division of Engineering Brown University Providence RI 02912 United States

ISBN: (纸本)0769522238

This paper proposes a novel method for global registration based on matching 3d medial structures of unorganized point clouds or triangulated meshes. Most practical known methods are based on the Iterative Closest Point (ICP) algorithm, which requires an initial alignment close to the globally optimal solution to ensure convergence to a valid solution. Furthermore, it can also fail when there are points in one dataset with no corresponding matches in the other dataset. The proposed method automatically finds an initial alignment close to the global optimal by using the medial structure of the datasets. For this purpose, we first compute the medial scaffold of a 3d dataset: a 3d graph made of special shock curves linking special shock nodes. This medial scaffold is then regularized exploiting the known transitions of the 3d medial axis under deformation or perturbation of the input data. The resulting simplified medial scaffolds are then registered using a modified graduated assignment graph matching algorithm. The proposed method shows robustness to noise, shape deformations, and varying surface sampling densities. © 2004 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Enhanced vector quantization for data reduction and filtering

Enhanced vector quantization for data reduction and filterin...

引用

2nd international symposium on 3d data processing, visualization, and transmission (3dPVI 2004)

作者： Ferrari, S Frosio, I Piuri, V Borghese, NA Univ Milan Dept Comp Sci MAVR Lab I-20135 Milan Italy

ISBN: (纸本)0769522238

Modem automatic digitizers can sample huge amounts of 3d data points on the object surface in a short time. Point based graphics is becoming a popular framework to reduce the cardinality of these data sets and to filter measurement noise, without having to store in memory and process mesh connectivity. Main contribution of this paper is the introduction of soft clustering techniques in the field of point clouds processing. In this approach data points are not assigned to a single cluster, but they contribute in the determination of the position of several cluster centres. As a result a better representation of the data is achieved. In Soft clustering techniques, a data set is represented with a reduced number of points called Reference Vectors (RV), which minimize an adequate error measure. As the position of the RVs is determined by "learning", which can be viewed as an iterative optimization procedure, they are inherently slow. We show here how partitioning the data domain into disjointed regions called hyperboxes (HB), the computation can be localized and the computational time reduced to linear in the number of data points (O(N)), saving more than 75% on real applications with respect to classical soft-VQ solutions, making therefore VQ suitable to the task. The procedure is suitable for a parallel HW implementation, which would lead to a complexity sub-linear in N. An automatic procedure for setting the voxel side and the other parameters can be derived from the data-set analysis. Results obtained in the reconstruction of faces of both humans and puppets as well as on models from clouds of points made available on the WEB are reported and discussed in comparison with other available methods.

关键词： Signal filtering and prediction

来源：评论

学校读者我要写书评

暂无评论

Interactive modeling from dense color and sparse depth

Interactive modeling from dense color and sparse depth

引用

Proceedings - 2nd international symposium on 3d data processing, visualization, and transmission. 3dPVT 2004

作者： Popescu, Voicu Sacks, Elisha Bahrautov, Gleb Computer Science Department Purdue University

ISBN: (纸本)0769522238

We are developing a system for interactive modeling of real world scenes, The acquisition device consists of a video camera enhanced with an attached laser system. As the operator sweeps the scene, the device acquires dense color and sparse depth frames that are registered and merged into a point-based model. The evolving model is rendered continually to provide immediate operator feedback. The interactive modeling pipeline runs at five frames per second. We model scenes in two modes based on their geometric complexity. Scenes that contain large smooth surfaces are modeled freehand;scenes that contain small uneven surfaces are modeled using a parallax-free camera bracket. © 2004 IEEE.

关键词： data acquisition

来源：评论

学校读者我要写书评

暂无评论

A variational analysis of shape from specularities using sparse data

A variational analysis of shape from specularities using spa...

引用

2nd international symposium on 3d data processing, visualization, and transmission (3dPVI 2004)

作者： Solem, JE Aanæs, H Heyden, A Malmo Univ Sch Technol & Soc Malmo Sweden

ISBN: (纸本)0769522238

Looking around in our every day environment, many of the encountered objects are specular to some degree. Actively using this fact when reconstructing objects front image sequences is the scope of the shape from specularities problem. One reason why this problem is important is that standard structure from motion techniques fail when the object surfaces are specular Here this problem is addressed by estimating surface shape using information from the specular reflections. A specular reflection gives constraints on the surface normal. The approach taken in this paper differs significantly from many earlier shape from specularities methods since the normal data used is sparse. The main contribution of this paper is to give a solid foundation for shape from specularities problems. Estimation of surface shape using reflections is formulated as a variational problem and the surface is represented implicitly using a level set formulation. A functional incorporating all surface constraints is proposed and the corresponding level set motion PdE is explicitly derived. This motion is then proven to minimize the functional. As a part of this functional a variational approach to normal alignment is proposed and analyzed. Also novel methods for implicit surface interpolation to sparse point sets are presented together with a variational analysis. Experiments on both real and synthetic data support the proposed method.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Automatic passive recovery of 3d from images and video

Automatic passive recovery of 3D from images and video

引用

2nd international symposium on 3d data processing, visualization, and transmission (3dPVI 2004)

作者： Nistér, d Univ Kentucky Dept Comp Sci Ctr Visualizat & Virtual Environm Lexington KY 40506 USA

ISBN: (纸本)0769522238

This paper gives a summary of automatic passive reconstruction of 3d scenes from images and video. Features are tracked between the images. Relative camera poses are then estimated based on the feature tracks. Both the feature tracking and the robust method used to estimate the camera poses has recently been shown to provide robust real-time performance. Given the camera poses, a more elaborate method is used to derive dense textured surfaces. The dense reconstruction method was originally part of the authors thesis [12]. It first computes depth maps using graph cuts, optimizing a Bayesian formulation. The graph cut operation is used to let depth map hypotheses from various sources compete in order to optimize the cost function. The hypothesis generators used are feature based surface triangulation, plane fitting and multi-hypothesis multi-scale patch-based stereo. The requirements for a cost function to fit into the graph cut framework were already given in [12], along with a procedure for constructing the graph weights corresponding to any cost function that satisfies the requirements. depth maps from many different viewpoints are then robustly fused to give a consistent global result using a process called median fusion. The robustness of the median fusion is important. It departs from the too common practice of fusing results by either using the union of free-space constraints as the resulting free-space, or the union of all predicted surfaces as the resulting surfaces, which is tremendously error-prone, since it essentially corresponds to taking either the minimum or maximum of the individual results.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Surface model generation from range images of industrial environments

Surface model generation from range images of industrial env...

引用

Proceedings - 2nd international symposium on 3d data processing, visualization, and transmission. 3dPVT 2004

作者： Sappa, Angel d. Computer Vison Center Edifici O Campus UAB 08193 Bellaterra - Barcelona Spain

ISBN: (纸本)0769522238

This paper presents an hybrid segmentation technique that combines both the speed of an edge based approach with the robustness of a surface based approach. It consists of three stages. In the first stage a scan line approximation process extracts the edges contained into the given range image. These edges are later on used to define the positions of seed points. Through the second stage a two steps region growing technique is applied. First a 2d growing process enlarges the original seed points generating bigger regions. Next, each region is fitted to a plane and a cylinder. The one that best fit the given points is selected to represent that region and used during the 3d growing stage. The 3d growing stage is carried out taking into account the approximation error from candidate points to be added to the fitted surface. In this way, each surface is grown until no points can be added according to a user defined threshold. Finally, in the third stage, a post-processing algorithm merges neighbour regions that belong to the same surface. Experimental results by using industrial environments are presented. © 2004 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A structure-from-motion method: USE of motion in three-dimensional reconstruction of moving objects from multiple-view image sequences

A structure-from-motion method: USE of motion in three-dimen...

引用

Proceedings - 2nd international symposium on 3d data processing, visualization, and transmission. 3dPVT 2004

作者： Le, Ha Vu Dept. of Elec. and Comp. Engineering Vietnam National University Hanoi 144 Xuan Thuy E3-202 Cau Giay Hanoi Viet Nam

ISBN: (纸本)0769522238

Solving the correspondence problem is the most essential task for multiview reconstruction techniques, yet finding unique correspondences between multiple views is impossible at some points, due to such problems as occlusions and ambiguities. We have developed a closed-form solution through constructive geometry for a special case of the structure-from-motion (SfM) problem with four rigidly moving points. This solution allows the 3-d position of a point on a moving object to be computed without having to find the correspondence between its projections on the image planes of multiple views, given its projected 2-d motion vector on an image plane and 3-d information of three other points. With this method we do not have to depend entirely on stereo/multiview feature correspondences in reconstructing 3-d objects, hence easing those problems caused by occlusions and ambiguities. © 2004 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Fast interpolated cameras by combining a GPU based plane sweep with a Max-flow regularisation algorithm

Fast interpolated cameras by combining a GPU based plane swe...

引用

Proceedings - 2nd international symposium on 3d data processing, visualization, and transmission. 3dPVT 2004

作者： Gevs, Indra Koninckx, Thomas P. Van Gonl, Luc ESAT PSI-VISICS Katholieke Universiteit Leuven Kasteelpark Arenberg 10 3001 Leuven Belgium D-ITET BIWI Swiss Fed. Institute of Technology Gloriastrasse 35 8092 Zürich Switzerland

ISBN: (纸本)0769522238

The paper presents a method for the high speed calculation of crude depth maps. Performance and applicability are illustrated for view interpolation based on two input video streams, but the algorithm is perfectly amenable to multi-camera environments. First a fast plane sweep algorithm generates the crude depth map. Speed results from hardware accelerated transformations and parallel processing available on the GPU. All computations on the graphical board are performed pixel-wise and a single pass of the sweep only processes one input resolution. A second step uses a min-cut/max-flow algorithm to ameliorate the previous result. The depth map, a noisy interpolated image and correlation measures are available on the GPU. They are reused and combined with spatial connectivity information and temporal continuity considerations in a graph formulation. Position dependent sampling densities allow the system to use multiple image resolutions. The min-cut separation of this graph yields the global minimum of the associated energy function. Limiting the search range according to the initialisation provided by the plane sweep further speeds up the process. The required hardware are only two cameras and a regular PC. © 2004 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Power-efficient sensor placement and transmission structure for data gathering under distortion constraints

Power-efficient sensor placement and transmission structure ...

引用

3rd international symposium on Information processing in Sensor Networks

作者： Ganesan, d Cristescu, R Beferull-Lozano, B Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA

ISBN: (纸本)1581138466

We consider the joint optimization of sensor placement and transmission structure for data gathering, where a given number of nodes need to be placed in a field such that the sensed data can be reconstructed at a sink within specified distortion bounds while minimizing the energy consumed for communication. We assume that the nodes use joint entropy coding based on explicit communication between sensor nodes, and consider both maximum and average distortion bounds. The optimization is complex since it involves an interplay between the spaces of possible transmission structures given radio reachability limitations, and feasible placements satisfying distortion bounds. We address this problem by first looking at the simplified problem of optimal placement in the one-dimensional case. An analytical solution is derived for the case when there is a simple aggregation scheme, and numerical results are provided for the cases when joint entropy encoding is used. We use the insight from our 1-d analysis to extend our results to the 2-d case, and show that our algorithm for two-dimensional placement and transmission structure provides significant power benefit over a commonly used combination of uniformly random placement and shortest path trees.

关键词： sensor networks data gathering information theory sensor node placement energy efficiency sensing distortion

来源：评论

学校读者我要写书评

暂无评论

Point samples for efficient 3d processing and content creation

Point samples for efficient 3D processing and content creati...

引用

international symposium on 3d data processing visualization and transmission

作者： M. Gross

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：