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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

13 篇 会议

馆藏范围

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

日期分布

学科分类号

5 篇 理学
- 3 篇 数学
- 2 篇 物理学
- 2 篇 生物学
- 1 篇 统计学（可授理学、...
3 篇 工学
- 2 篇 光学工程
- 2 篇 计算机科学与技术...
- 2 篇 软件工程
- 2 篇 生物工程
- 1 篇 机械工程
- 1 篇 控制科学与工程
2 篇 法学
- 2 篇 社会学

主题

7 篇 computer vision
5 篇 laboratories
5 篇 numerical analys...
5 篇 object recogniti...
4 篇 computer science
4 篇 cameras
4 篇 humans
3 篇 layout
2 篇 councils
2 篇 covariance matri...
2 篇 pattern recognit...
2 篇 histograms
2 篇 image recognitio...
2 篇 robustness
1 篇 filters
1 篇 support vector m...
1 篇 trees (mathemati...
1 篇 statistics
1 篇 voting
1 篇 spatial database...

机构

3 篇 computational vi...
2 篇 department of co...
2 篇 department of co...
2 篇 school of comput...
1 篇 department of co...
1 篇 computational vi...
1 篇 computational vi...
1 篇 department of nu...
1 篇 computational vi...
1 篇 computational vi...
1 篇 computational vi...
1 篇 computational vi...
1 篇 dept. of compute...
1 篇 ab kogs fb infor...
1 篇 laboratory of im...
1 篇 laboratory of im...
1 篇 department of nu...
1 篇 department of co...
1 篇 computational vi...
1 篇 computational vi...

作者

3 篇 t. lindeberg
3 篇 i. laptev
3 篇 dickinson sven
2 篇 bretzner lars
2 篇 b. caputo
2 篇 tsotsos john
2 篇 keselman yakov
2 篇 christensen henr...
2 篇 shokoufandeh ali
1 篇 olsson lars
1 篇 ramström ola
1 篇 fatili demirci m...
1 篇 olofsson
1 篇 dickinson sven j...
1 篇 stevenson suzann...
1 篇 dickinson
1 篇 o. linde
1 篇 jasiobedzki
1 篇 p. fornland
1 篇 m.e. nilsback

语言

13 篇 英文

检索条件"机构=Computational Vision and Active Perception Num. Analysis and Computer Science"

共 13 条记录，以下是1-10 订阅

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

详细简洁

排序：

Integrating object and grasp recognition for dynamic scene interpretation

Integrating object and grasp recognition for dynamic scene i...

引用

International Conference on Advanced Robotics (ICAR)

作者： S. Ekvall D. Kragic Computational Vision and Active Perception Laboratory Centre for Autonomous Systems Department of Numerical Analysis and Computer Science Royal Institute of Technology Stockholm Sweden

Understanding and interpreting dynamic scenes and activities is a very challenging problem. In this paper, we present a system capable of learning robot tasks from demonstration. Classical robot task programming requires an experienced programmer and a lot of tedious work. In contrast, programming by demonstration is a flexible framework that reduces the complexity of programming robot tasks, and allows end-users to demonstrate the tasks instead of writing code. We present our recent steps towards this goal. A system for learning pick-and-place tasks by manually demonstrating them is presented. Each demonstrated task is described by an abstract model involving a set of simple tasks such as what object is moved, where it is moved, and which grasp type was used to move it

关键词： Layout Robot programming Writing Humans Sensor phenomena and characterization Object recognition computer vision Laboratories num.rical analysis computer science

来源：评论

学校读者我要写书评

暂无评论

Object recognition using composed receptive field histograms of higher dimensionality

Object recognition using composed receptive field histograms...

引用

International Conference on Pattern Recognition

作者： O. Linde T. Lindeberg Department of Numerical Analysis and Computer Science KTH Computational Vision and Active Perception Laboratory Stockholm Sweden

Effective methods for recognising objects or spatio-temporal events can be constructed based on receptive field responses summarised into histograms or other histogram-like image descriptors. This work presents a set of composed histogram features of higher dimensionality, which give significantly better recognition performance compared to the histogram descriptors of lower dimensionality that were used in the original papers by Swain & Bollard (1991) or Schiele & Crowley (2000). The use of histograms of higher dimensionality is made possible by a sparse representation for efficient computation and handling of higher-dimensional histograms. Results of extensive experiments are reported, showing how the performance of histogram-based recognition schemes depend upon different combinations of cues, in terms of Gaussian derivatives or differential invariants applied to either intensity information, chromatic information or both. It is shown that there exist composed higher-dimensional histogram descriptors with much better performance for recognising known objects than previously used histogram features. Experiments are also reported of classifying unknown objects into visual categories.

关键词： Object recognition Histograms Image recognition Statistics Wavelet coefficients computer vision Laboratories num.rical analysis computer science Councils

来源：评论

学校读者我要写书评

暂无评论

Cue integration through discriminative accumulation

Cue integration through discriminative accumulation

引用

Conference on computer vision and Pattern Recognition (CVPR)

作者： M.E. Nilsback B. Caputo Department of Numerical Analysis and Computer Science Computational Vision and Active Perception Laboratory (CVAP) KTH Stockholm Sweden

Object recognition systems aiming to work in real world settings should use multiple cues in order to achieve robustness. We present a new cue integration scheme, which extends the idea of cue accumulation to discriminative classifiers. We derive and test the scheme for support vector machines (SVMs), but we also show that it is easily extendible to any large margin classifier. In the case of one-class SVMs the scheme can be interpreted as a new class of Mercer kernels for multiple cues. Experimental comparison with a probabilistic accumulation scheme is favorable to our method. Comparison with voting scheme shows that our method may suffer as the num.er of object classes increases. Based on these results, we propose a recognition algorithm consisting of a decision tree where decisions at each node are taken using our accumulation scheme. Results obtained using this new algorithm compare very favorably to accumulation (both probabilistic and discriminative) and voting scheme.

关键词： Voting Object recognition Robustness computer vision Histograms Humans Laboratories num.rical analysis computer science Testing

来源：评论

学校读者我要写书评

暂无评论

Velocity adaptation of space-time interest points

Velocity adaptation of space-time interest points

引用

International Conference on Pattern Recognition

作者： I. Laptev T. Lindeberg Computational Vision and Active Perception Laboratory (CVAP) Department of Numerical Analysis and Computer Science KTH Royal Institute of Technology Stockholm Sweden

The notion of local features in space-time has recently been proposed to capture and describe local events in video. When computing space-time descriptors, however, the result may strongly depend on the relative motion between the object and the camera. To compensate for this variation, we present a method that automatically adapts the features to the local velocity of the image pattern and, hence, results in a video representation that is stable with respect to different amounts of camera motion. Experimentally we show that the use of velocity adaptation substantially increases the repeatability of interest points as well as the stability of their associated descriptors. Moreover, for an application to human action recognition we demonstrate how velocity-adapted features enable recognition of human actions in situations with unknown camera motion and complex, non-stationary backgrounds.

关键词： Cameras Humans Image motion analysis Pattern recognition Motion measurement Optical recording Covariance matrix computer vision Laboratories num.rical analysis

来源：评论

学校读者我要写书评

暂无评论

Recognizing human actions: a local SVM approach

Recognizing human actions: a local SVM approach

引用

International Conference on Pattern Recognition

作者： C. Schuldt I. Laptev B. Caputo Computational Vision and Active Perception Laboratory (CVAP) Department of Numerical Analysis and Computer Science KTH Royal Institute of Technology Stockholm Sweden

Local space-time features capture local events in video and can be adapted to the size, the frequency and the velocity of moving patterns. In this paper, we demonstrate how such features can be used for recognizing complex motion patterns. We construct video representations in terms of local space-time features and integrate such representations with SVM classification schemes for recognition. For the purpose of evaluation we introduce a new video database containing 2391 sequences of six human actions performed by 25 people in four different scenarios. The presented results of action recognition justify the proposed method and demonstrate its advantage compared to other relative approaches for action recognition.

关键词： Humans Support vector machines computer vision Pattern recognition Support vector machine classification Cameras Frequency Spatial databases Performance evaluation Image recognition

来源：评论

学校读者我要写书评

暂无评论

Galilean-diagonalized spatio-temporal interest operators

Galilean-diagonalized spatio-temporal interest operators

引用

International Conference on Pattern Recognition

作者： T. Lindeberg A. Akbarzadeh I. Laptev Computational Vision and Active Perception Laboratory (CVAP) Department of Numerical Analysis and Computer Science KTH Royal Institute of Technology Stockholm Sweden

This paper presents a set of image operators for detecting regions in space-time where interesting events occur. To define such regions of interest, we compute a spatio-temporal second-moment matrix from a spatio-temporal scale-space representation, and diagonalize this matrix locally, using a local Galilean transformation in space-time, optionally combined with a spatial rotation, so as to make the Galilean invariant degrees of freedom explicit. From the Galilean-diagonalized descriptor so obtained, we then formulate different types of space-time interest operators, and illustrate their properties on different types of image sequences.

关键词： Cameras Covariance matrix computer vision Laboratories num.rical analysis computer science Image sequences Layout Councils Filters

来源：评论

学校读者我要写书评

暂无评论

Many-to-many feature matching using spherical coding of directed graphs 8

引用

8th European Conference on computer vision, ECCV 2004

作者： Fatili Demirci, M. Shokoufandeh, Ali Dickinson, Sven Keselman, Yakov Bretzner, Lars Department of Computer Science Drexel University PhiladelphiaPA19104 United States Department of Computer Science University of Toronto TorontoONM5S 3G4 Canada School of Computer Science Telecommunications and Information Systems DePaul University ChicagoIL60604 United States Computational Vision and Active Perception Laboratory Department Of Numerical Analysis and Computer Science KTH Stockholm Sweden

ISBN: (纸本)3540219846

Abstract. In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge-weighted directed graph. The algorithm was based on a metric-tree representation of labeled graphs and their metric embedding into normed vector spaces, using the embedding algorithm of Matousek [13]. However, the method was limited by the fact that two graphs to be matched were typically embedded into vector spaces with different dimensionality. Before the embeddings could be matched, a dimensionality reduction technique (PCA) was required, which was both costly and prone to error. In this paper, we introduce a more efficient embedding procedure based on a spherical coding of directed graphs. The advantage of this novel embedding technique is that it prescribes a single vector space into which both graphs are embedded. This reduces the problem of directed graph matching to the problem of geometric point matching, for which efficient many-to-many matching algorithms exist, such as the Earth Mover's Distance. We apply the approach to the problem of multi-scale, view-based object recognition, in which an image is decomposed into a set of blobs and ridges with automatic scale selection. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Many-to-many matching of scale-space feature hierarchies using metric embedding

Many-to-many matching of scale-space feature hierarchies usi...

引用

4th International Conference on Scale Space Methods in computer vision, Scale Space 2003

作者： Fatih Demirci, M. Shokoufandeh, Ali Keselman, Yakov Dickinson, Sven Bretzner, Lars Department of Computer Science Drexel University PhiladelphiaPA19104 United States School of Computer Science Telecommunications and Information Systems DePaul University ChicagoIL60604 United States Department of Computer Science University of Toronto TorontoONM5S 3G4 Canada Computational Vision and Active Perception Laboatory Department of Numerical Analysis and Computer Science KTH Stockholm Sweden

ISBN: (纸本)354040368X

Scale-space feature hierarchies can be conveniently represented as graphs, in which edges are directed from coarser features to finer features. Consequently, feature matching (or view-based object matching) can be formulated as graph matching. Most approaches to graph matching assume a one-to-one correspondence between nodes (features) which, due to noise, scale discretization, and feature extraction errors, is overly restrictive. In general, a subset of features in one hierarchy, representing an abstraction of those features, may best match a subset of features in another. We present a framework for the many-tomany matching of multi-scale feature hierarchies, in which features and their relations are captured in a vertex-labeled, edge-weighted graph. The matching algorithm is based on a metric-tree representation of labeled graphs and their low-distortion metric embedding into normed vector spaces. This two-step transformation reduces the many-to-many graph matching problem to that of computing a distribution-based distance measure between two such embeddings. To compute the distance between two sets of embedded, weighted vectors, we use the Earth Mover’s Distance under transformation. To demonstrate the approach, we target the domain of multi-scale, qualitative shape description, in which an image is decomposed into a set of blobs and ridges with automatic scale selection. We conduct an extensive set of view-based matching trials, and compare the results favorably to matching under a one-to-one assumption. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Visual attention using game theory 2

引用

2nd International Workshop on Biologically Motivated computer vision, BMCV 2002

作者： Ramström, Ola Christensen, Henrik I. Computational Vision and Active Perception Numerical Analysis and Computer Science Royal Institute of Technology StockholmSE-100 44 Sweden

ISBN: (纸本)9783540001744

A system using visual information to interact with its environment, e.g. a robot, needs to process an enormous amount of data. To ensure that the visual process has tractable complexity visual attention plays an important role. A visual process will always have a num.er of implicit and explicit tasks that defines its purpose. The present document discusses attention mechanisms for selection of visual input to respond to the current set of tasks. To provide a truly distributed approach to attention it is suggested to model the control using game theory, in particular coalition games. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

A robust and convergent iterative approach for determining the dominant plane from two views without correspondence and calibration

A robust and convergent iterative approach for determining t...

引用

Conference on computer vision and Pattern Recognition (CVPR)

作者： P. Fornland C. Schnorr Computational Vision and Active Perception Num. Analysis and Computer Science Royal Institute of Technology Stockholm Sweden AB Kogs FB Informatik University of Hamburg Hamburg Germany

A robust, iterative approach is introduced for finding the dominant plane in a scene using binocular vision. Neither camera calibration nor stereo correspondence is required. Recently L. Cohen (1996) formalized a framework guaranteeing (local) convergence of iterative two-step methods. In this paper, the framework is adopted, with a global step using tentative matches to estimate the planar projectivity, and a local step attempting to solve the stereo correspondence. A detected point in the first image is matched to an auxiliary point in the second image, on the line joining the transformed first image point, and its closest detected second image point. Convergence is assured, while achieving robustness to both mismatching and non-coplanar points.

关键词： Robustness Iterative methods Convergence Calibration Cameras Robot kinematics computer vision Layout Robot vision systems Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：