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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

221 篇 会议
57 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

222 篇 工学
- 155 篇 计算机科学与技术...
- 137 篇 软件工程
- 47 篇 信息与通信工程
- 34 篇 光学工程
- 31 篇 控制科学与工程
- 28 篇 生物工程
- 20 篇 电气工程
- 18 篇 生物医学工程（可授...
- 17 篇 机械工程
- 14 篇 电子科学与技术（可...
- 12 篇 仪器科学与技术
- 12 篇 建筑学
- 8 篇 化学工程与技术
- 8 篇 安全科学与工程
- 7 篇 土木工程
- 6 篇 交通运输工程
- 5 篇 力学（可授工学、理...
129 篇 理学
- 64 篇 数学
- 55 篇 物理学
- 28 篇 生物学
- 24 篇 统计学（可授理学、...
- 7 篇 化学
- 6 篇 系统科学
47 篇 管理学
- 31 篇 图书情报与档案管...
- 17 篇 管理科学与工程(可...
- 7 篇 工商管理
10 篇 法学
- 10 篇 社会学
10 篇 医学
- 9 篇 临床医学
- 6 篇 基础医学(可授医学...
3 篇 艺术学
- 3 篇 设计学（可授艺术学...
2 篇 农学
1 篇 经济学
1 篇 教育学

主题

8 篇 image segmentati...
8 篇 robot sensing sy...
7 篇 computer vision
6 篇 cameras
6 篇 switches
6 篇 semantics
5 篇 force
5 篇 feature extracti...
5 篇 estimation
5 篇 robot kinematics
4 篇 object detection
4 篇 friction
4 篇 deep neural netw...
4 篇 robots
4 篇 computational mo...
4 篇 classification (...
4 篇 torque
3 篇 image enhancemen...
3 篇 conferences
3 篇 surface treatmen...

机构

13 篇 tianjin key lab....
11 篇 key laboratory o...
8 篇 computer vision ...
8 篇 computer vision ...
8 篇 school of comput...
6 篇 shandong key lab...
4 篇 computer vision ...
4 篇 sharif universit...
3 篇 department of in...
3 篇 department of el...
3 篇 social robotics ...
3 篇 moscow state uni...
3 篇 shenzhen key lab...
3 篇 university of ch...
3 篇 git vision lab. ...
3 篇 comput. vision l...
3 篇 institute for co...
3 篇 computer vision ...
3 篇 computer vision ...
3 篇 don state techni...

作者

11 篇 sablatnig robert
11 篇 danica kragic
10 篇 kampel martin
10 篇 yiannis karayian...
10 篇 christian smith
9 篇 petter ögren
7 篇 akgul yusuf sina...
6 篇 kragic danica
5 篇 zambanini sebast...
5 篇 zhang degan
5 篇 rajagopalan a.n.
5 篇 michele colledan...
5 篇 ebrahimnezhad ho...
5 篇 zhang caiming
5 篇 qiao yu
5 篇 diem markus
4 篇 zelensky a.
4 篇 hahn minsoo
4 篇 kim jinsul
4 篇 langs georg

语言

259 篇 英文
13 篇 其他
5 篇 中文
1 篇 土耳其文

检索条件"机构=Lab. for Computer Vision and Media Technology"

共 278 条记录，以下是211-220 订阅

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

详细简洁

排序：

vision-based railroad track extraction using dynamic programming

Vision-based railroad track extraction using dynamic program...

引用

2009 12th International IEEE Conference on Intelligent Transportation Systems, ITSC '09

作者： Kaleli, Fatih Akgul, Yusuf Sinan GIT Vision Lab. Department of Computer Engineering Gebze Institute of Technology Gebze Kocaeli 41400 Turkey

ISBN: (纸本)9781424455218

Most of the common driver assistant systems for detection of obstacles work on unstructured environments. These environments generally include many non-planar surfaces which pose a big challenge for vision systems. Similar problems exist for railroad environments which often contain complex shapes and surfaces like hills and vegetation along railroad tracks. In railroad transportation, the main task of a train driver is to carefully focus on the track. Therefore the field of view of a train driver must contain the space between two rails in front of the train and the near lateral area (left and right side) of these rails. In this paper, we present an algorithm to extract the train course and railroad track space in front of the train using dynamic programming in railroad environments. We use dynamic programming to compute the optimal path which gives the minimum cost to extract the railroad track space. The proposed algorithm extracts the left and right rails using dynamic programming simultaneously. Our method does not need any static calibration process. For this purpose, a camera system was installed in front of a locomotive. Experimental results show the effectiveness of the algorithm. © 2009 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Locating texture boundaries using a fast unsupervised approach based on clustering algorithms fusion and level set

Locating texture boundaries using a fast unsupervised approa...

引用

2009 IEEE International Conference on Signal and Image Processing Applications, ICSIPA09

作者： Emambakhsh, Mehryar Sedaaghi, Mohammad Hossein Ebrahimnezhad, Hossein Computer Vision Lab. Department of Electrical Engineering Sahand University of Technology Sahand New City Tabriz Iran

ISBN: (纸本)9781424455614

Image segmentation deals with partitioning an input image into disjoint/non-overlapping regions. Among different segmentation algorithms, level set methods have been very popular. Less sensitivity to initialization, ability to split and merge the contour, and also, involving statistical inference have made level set even more accepted than similar methods like snakes. However, it is very time-consuming. To solve this problem, in this paper a fast variational approach is presented for texture segmentation. For this purpose, first a feature space based on non-linear diffusion is set up from CIE L*a*b* colour components. Then, this feature space is clustered by fusion of clustering algorithms. Finally, the produced cluster map is used in level set for contour evolution. As it is shown in the simulation results, our algorithm is robust in segmenting noisy texture. Also, it is faster than previous level set approaches for texture segmentation.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic MRI brain segmentation using local features, self-organizing maps, and watershed

Automatic MRI brain segmentation using local features, self-...

引用

2009 IEEE International Conference on Signal and Image Processing Applications, ICSIPA09

作者： Emambakhsh, Mehryar Sedaaghi, Mohammad Hossein Computer Vision Lab. Department of Electrical Engineering Sahand University of Technology Sahand New City Tabriz Iran

ISBN: (纸本)9781424455614

Image segmentation is the process of partitioning an input image into non-overlapping/disjoint regions. Various methods have been used for image segmentation. Among these methods, watershed-based algorithms have been widely utilized due to their fast computational speed. However, their sensitivity to noise, and also over-segmentation, has made watershed approaches unsuitable for noisy images. In this paper, a novel method for MRI segmentation is proposed. For this purposed, a simple and fast feature extraction method is used. Then, the feature space, is clustered by Self-Organizing Map Neural Networks (SOMNN). After that, an edge map is set up from the clustering result. Finally, watershed transformation is utilized on the edge map. Our algorithm is robust against noise. Although watershed transformation is used in our approach, a region merging and denoising algorithms are not utilized as pre- and post- processing, respectively. This significantly improves the segmentation speed.

关键词： Watersheds

来源：评论

学校读者我要写书评

暂无评论

Shadow detection in dynamic scenes using dense stereo information and an outdoor illumination model

Shadow detection in dynamic scenes using dense stereo inform...

引用

DAGM Workshop on Dynamic 3D Imaging, Dyn3D 2009

作者： Madsen, Claus B. Moeslund, Thomas B. Pal, Amit Balasubramanian, Shankkar Computer Vision and Media Technology Lab Aalborg University Aalborg Denmark Department of Electronics and Communication Engineering Indian Institute of Technology Guwahati Assam India

ISBN: (纸本)3642037771

We present a system for detecting shadows in dynamic outdoor scenes. The technique is based on fusing background subtraction operations performed on both color and disparity data, respectively. A simple geometrical analysis results in an ability to classify pixels into foreground, shadow candidate, and background. The shadow candidates are further refined by analyzing displacements in log chromaticity space to find the shadow hue shift with the strongest data support and ruling out other displacements. This makes the shadow detection robust towards false positives from rain, for example. The techniques employed allow for 3Hz operation on commodity hardware using a commercially availab.e dense stereo camera solution. © 2009 Springer Berlin Heidelberg.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

Inpainting in shape from focus: Taking a cue from motion parallax

Inpainting in shape from focus: Taking a cue from motion par...

引用

2009 20th British Machine vision Conference, BMVC 2009

作者： Sahay, Rajiv R. Rajagopalan, A.N. Image Processing and Computer Vision Lab. Department of Electrical Engineering Indian Institute of Technology Madras Chennai 600 036 India

ISBN: (纸本)1901725391

Shape from focus (SFF) which uses a sequence of space-variantly defocused frames works under the constraint that there is 'no magnification' in the stack. In the presence of sensor damage and/or occlusions, there will be missing data in the observations and SFF cannot recover structure in those regions. In many applications, the capability of filling-in missing data is of critical importance. In this paper, we investigate the effect of motion parallax in SFF and demonstrate the interesting possibility of how it can be judiciously used to jointly inpaint image and depth profiles. When there is relative motion between the 3D specimen and the camera, by virtue of the inherent pixel motion in each of the frames, it is possible to obtain a focused image and depth map of the scene despite missing regions in the observations. © 2009. The copyright of this document resides with its authors.

关键词： Geometrical optics

来源：评论

学校读者我要写书评

暂无评论

Grasp recognition and mapping on humanoid robots

Grasp recognition and mapping on humanoid robots

引用

9th IEEE-RAS International Conference on Humanoid Robots, HUMANOIDS09

作者： Do, Martin Romero, Javier Kjellström, Hedvig Azad, Pedram Asfour, Tamim Kragic, Danica Dillmann, Rüdiger KTH - Royal Institute of Technology Stockholm Sweden Computer Vision and Active Perception Lab. Centre for Autonomous Systems Sweden Karlsruhe Germany Institute for Anthropomatics Germany

ISBN: (纸本)9781424445882

In this paper, we present a system for vision-based grasp recognition, mapping and execution on a humanoid robot to provide an intuitive and natural communication channel between humans and humanoids. This channel enables a human user to teach a robot how to grasp an object. The system comprises three components: human upper body motion capture system which provides the approaching direction towards an object, hand pose estimation and grasp recognition system, which provides the grasp type performed by the human as well as a grasp mapping and execution system for grasp reproduction on a humanoid robot with five-fingered hands. All three components are real-time and markerless. Once an object is reached, the hand posture is estimated, including hand orientation and grasp type. For the execution on a robot, hand posture and approach movement are mapped and optimized according to the kinematic limitations of the robot. Experimental results are performed on the humanoid robot ARMAR-IIIb. ©2009 IEEE.

关键词： Anthropomorphic robots

来源：评论

学校读者我要写书评

暂无评论

An efficient image processing method based on web services for mobile devices

An efficient image processing method based on web services f...

引用

2009 2nd International Congress on Image and Signal Processing, CISP'09

作者： Yi, Liang Yingyuan, Xiao Jing, Huang Tianjin Key Lab. of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin China

ISBN: (纸本)9781424441310

The resource limitation of mobile devices causes the problem that the existing image processing software based on the centralized computing mode had difficulty running in mobile devices. A solution is given in the paper by adopting web service-based image processing method. For one thing, image processing tasks were distributed to service providers' service registry and service requesters. For another, what the service providers should do was only to invocate the specific image processing services provided by service providers. Consequently, web service-based solution reduces the resource consumption of mobile devices by redistributing image processing tasks. Compared with traditional methods of image processing, Web service-based image processing method has the advantages of loose coupling and component oriented and can take full advantage of the computing resources in heterogeneous network. Thus web service-based image processing method can effectively solve the resource bottle-neck that traditional image processing software had. ©2009 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Electromagnetic side channel: A comparison of multi-class feature selection methods

Electromagnetic side channel: A comparison of multi-class fe...

引用

6th IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2009

作者： Dyrkolbotn, Geir O. Snekkenes, E. Department of Computer Science and Media Technology Norwegian Information Security Lab. Gjovik University College P.O. Box 191 2802 Gjovik Norway

ISBN: (纸本)9780889867888

When a microprocessor executes its program, electromagnetic signals are generated as a consequence of the power consumption associated with transistor transition. The intercepted electromagnetic signal can be used to reveal the contents of program and/or data memory of the microprocessor, exploited in a variety of attacks [1] [2] [3] [4]. Common for these approaches is the need to map an unknown intercepted signal (trace) to a known set of activities on the microprocessor, often based on thousand of availab.e variables. It is unlikely that all variables contain relevant information and a large number of variables requires a lot of computational resources (storage and execution time). It is therefore of interest to reduce the number of variables by selecting lower dimensional subsets or mapping. This article gives an introduction to feature selection methods as well as suggestions as to how to handle a multi-class case. We use the wireless covert channel attack [4] to perform an application specific comparison between a selection of these methods. The different methods are compared by classification error and computational cost. Our results suggest use of the Greedy Forward Selection method, if preprocessing time is of no concern. Otherwise, ranking based methods give fair results. Experimental results also show that, in a wireless covert channel application, it is possible to classify microprocessor activity (i.e instruction executed), with a very low probability of error, given the energy emitted on only a few selected carrier frequencies. Implementation of a M-ary, multi carrier covert channel with a reasonable error rate is therefore feasible.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Paints, paper, and programs: First steps toward the computational sketchbook 09

Paints, paper, and programs: First steps toward the computat...

引用

3rd International Conference on Tangible and Embedded Interaction, TEI'09

作者： Buechley, Leah Hendrix, Sue Eisenberg, Mike High-Low Tech Group MIT Media Lab. United States Craft Technology Group Department of Computer Science University of Colorado Boulder United States

ISBN: (纸本)9781605584935

This paper describes what we believe to be important initial steps toward realizing a novel computational medium that combines elements of programming, painting, and papercrafts. Briefly, this genre of paper computing allows a user to create functional computational artifacts on painted paper substrates. We introduce a construction kit for paper computing that consists of computational elements - microcontrollers, sensors, actuators, and power sources - that are held on paper surfaces by magnetic paint and magnets. Conductive paint applied to these surfaces takes on the role of "wires", connecting the computational elements to one another. These elements can be moved around and from surface to surface, much like magnets on a refrigerator, and the overall result is a tangible medium in which painting, programming, and the affordances of paper blend together. In addition to introducing the kit, we describe example constructions and discuss a variety of potential applications, design projects, and issues for continued research. Copyright 2009 ACM.

关键词： Paint

来源：评论

学校读者我要写书评

暂无评论

Learning bregman distance functions and its application for semi-supervised clustering

Learning bregman distance functions and its application for ...

引用

23rd Annual Conference on Neural Information Processing Systems, NIPS 2009

作者： Lei, Wut Jin, Rong Hoit, Steven C.H. Zhu, Jianke Yu, Nenghai School of Computer Engineering Nanyang Technological University Singapore Singapore Department of Computer Science and Engineering Michigan State University United States Computer Vision Lab. ETH Zurich Switzerland Univeristy of Science and Technology of China China

ISBN: (纸本)9781615679119

Learning distance functions with side information plays a key role in many machine learning and data mining applications. Conventional approaches often assume a Mahalanobis distance function. These approaches are limited in two aspects: (i) they are computationally expensive (even infeasible) for high dimensional data because the size of the metric is in the square of dimensionality;(ii) they assume a fixed metric for the entire input space and therefore are unable to handle heterogeneous data. In this paper, we propose a novel scheme that learns nonlinear Bregman distance functions from side information using a non-parametric approach that is similar to support vector machines. The proposed scheme avoids the assumption of fixed metric by implicitly deriving a local distance from the Hessian matrix of a convex function that is used to generate the Bregman distance function. We also present an efficient learning algorithm for the proposed scheme for distance function learning. The extensive experiments with semi-supervised clustering show the proposed technique (i) outperforms the state-of-the-art approaches for distance function learning, and (ii) is computationally efficient for high dimensional data.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共28页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：