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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,506 篇 会议
29 篇 期刊文献
10 册 图书

馆藏范围

6,544 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,906 篇 工学
- 3,683 篇 计算机科学与技术...
- 1,504 篇 软件工程
- 802 篇 光学工程
- 359 篇 信息与通信工程
- 256 篇 控制科学与工程
- 204 篇 机械工程
- 176 篇 电气工程
- 95 篇 生物医学工程（可授...
- 79 篇 生物工程
- 77 篇 电子科学与技术（可...
- 61 篇 仪器科学与技术
- 38 篇 建筑学
- 36 篇 力学（可授工学、理...
- 34 篇 土木工程
- 31 篇 航空宇航科学与技...
- 31 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 22 篇 交通运输工程
1,537 篇 理学
- 980 篇 物理学
- 960 篇 数学
- 376 篇 统计学（可授理学、...
- 152 篇 生物学
- 34 篇 系统科学
- 24 篇 化学
168 篇 管理学
- 120 篇 图书情报与档案管...
- 50 篇 管理科学与工程(可...
- 33 篇 工商管理
139 篇 医学
- 138 篇 临床医学
- 21 篇 基础医学(可授医学...
20 篇 法学
- 19 篇 社会学
11 篇 农学
10 篇 教育学
7 篇 经济学
3 篇 军事学
3 篇 艺术学

主题

2,304 篇 computer vision
871 篇 pattern recognit...
640 篇 cameras
634 篇 computer science
577 篇 face recognition
553 篇 layout
523 篇 image segmentati...
509 篇 conferences
503 篇 shape
450 篇 robustness
438 篇 object recogniti...
390 篇 humans
341 篇 feature extracti...
318 篇 training
307 篇 object detection
261 篇 application soft...
259 篇 image recognitio...
250 篇 lighting
239 篇 image reconstruc...
237 篇 computational mo...

机构

44 篇 microsoft resear...
26 篇 department of co...
21 篇 swiss fed inst t...
21 篇 school of comput...
20 篇 department of co...
19 篇 swiss fed inst t...
19 篇 carnegie mellon ...
18 篇 department of co...
17 篇 department of in...
17 篇 the robotics ins...
17 篇 institute of com...
16 篇 univ sci & techn...
16 篇 robotics institu...
15 篇 tsinghua univ pe...
14 篇 department of el...
14 篇 school of comput...
14 篇 school of comput...
13 篇 univ maryland co...
13 篇 microsoft resear...
13 篇 microsoft resear...

作者

39 篇 timofte radu
28 篇 s.k. nayar
25 篇 xiaoou tang
25 篇 huang thomas s.
22 篇 t. kanade
20 篇 t.s. huang
19 篇 van gool luc
19 篇 t. darrell
19 篇 chellappa rama
18 篇 nayar shree k.
17 篇 a.k. jain
17 篇 a. zisserman
17 篇 jain anil k.
17 篇 zisserman andrew
16 篇 g. healey
16 篇 torralba antonio
16 篇 heung-yeung shum
16 篇 l. van gool
15 篇 zhang lei
15 篇 li stan z.

语言

6,544 篇 英文
1 篇 其他

检索条件"任意字段=2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005"

共 6545 条记录，以下是4661-4670 订阅

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

详细简洁

排序：

Image hallucination with primal sketch priors

Image hallucination with primal sketch priors

引用

conference on computer vision and pattern recognition (cvpr)

作者： Jian Sun Nan-Ning Zheng Hai Tao Heung-Yeung Shum The Institute of AI and Robotics Xi'an Jiaotong University Xi'an China Department of C.E University of California Santa Cruz Santa Cruz CA USA Microsoft Research Asia Beijing China

ISBN: (纸本)0769519008

We propose a Bayesian approach to image hallucination. Given a generic low resolution image, we hallucinate a high resolution image using a set of training images. Our work is inspired by recent progress on natural image statistics that the priors of image primitives can be well represented by examples. Specifically, primal sketch priors (e.g., edges, ridges and corners) are constructed and used to enhance the quality of the hallucinated high resolution image. Moreover, a contour smoothness constraint enforces consistency of primitives in the hallucinated image by a Markov-chain based inference algorithm. A reconstruction constraint is also applied to further improve the quality of the hallucinated image. Experiments demonstrate that our approach can hallucinate high quality super-resolution images.

关键词： Image resolution Image reconstruction Interpolation Image recognition Frequency Nearest neighbor searches Sun Asia computer vision Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Word image matching using dynamic time warping

Word image matching using dynamic time warping

引用

conference on computer vision and pattern recognition (cvpr)

作者： T.M. Rath R. Manmatha Multi-Media Indexing and Retrieval Group Center for Intelligent Information Retrieval University of Massachusetts Amherst MA USA

Libraries and other institutions are interested in providing access to scanned versions of their large collections of handwritten historical manuscripts on electronic media. Convenient access to a collection requires an index, which is manually created at great labor and expense. Since current handwriting recognizers do not perform well on historical documents, a technique called word spotting has been developed: clusters with occurrences of the same word in a collection are established using image matching. By annotating "interesting" clusters, an index can be built automatically. We present an algorithm for matching handwritten words in noisy historical documents. The segmented word images are preprocessed to create sets of 1-dimensional features, which are then compared using dynamic time warping. We present experimental results on two different data sets from the George Washington collection. Our experiments show that this algorithm performs better and is faster than competing matching techniques.

关键词： Image matching Image segmentation Indexing Information retrieval Handwriting recognition Optical character recognition software Character recognition Libraries Image recognition Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Feature selection by maximum marginal diversity: optimality and implications for visual recognition

Feature selection by maximum marginal diversity: optimality ...

引用

conference on computer vision and pattern recognition (cvpr)

作者： N. Vasconcelos Department of Electrical and Computer Engineering University of California San Diego USA

We have recently shown that: 1) the infomax principle for the organization of perceptual systems leads to visual recognition architectures that are nearly optimal in the minimum Bayes error sense, and 2) a quantity which plays an important role in infomax solutions is the marginal diversity (MD) - the average distance between the class-conditional density of each feature and their mean. Since MD is a discriminant quantity and can be computed with great efficiency, the principle of maximum marginal diversity (MMD) was suggested for discriminant feature selection. In this paper, we study the optimality (in the infomax sense) of the MMD principle and analyze its effectiveness for feature selection in the context of visual recognition. In particular, 1) we derive a close form relation between the optimal infomax and MMD solutions, and 2) show that there is a family of classification problems for which the two are identical. Examination of this family in light of recent studies on the statistics of natural images suggests that the equivalence conditions are likely to hold for the problem of visual recognition. We present experimental evidence supporting the conclusions that: 1) MD is a good predictor for the recognition ability of a given set of features; 2) MMD produces features that are more discriminant than those obtained with currently predominant criteria such as energy compaction; and 3) the extracted features are detectors of visual attributes that are perceptually relevant for low-level image classification.

关键词： Image recognition Compaction Feature extraction computer vision Character generation computer architecture computer errors Statistics Detectors Image classification

来源：评论

学校读者我要写书评

暂无评论

3D surface modeling from range curves

3D surface modeling from range curves

引用

conference on computer vision and pattern recognition (cvpr)

作者： D. Tubic P. Hebert D. Laurendeau Universite Laval Quebec QC CA Comput. Vision & Syst. Lab. Univ. Laval Que. Canada

Traditional approaches for surface reconstruction from range data require that the input data be either range images or unorganized sets of points. Since a large number of range sensors provide data along curvilinear patterns such as profiles, this paper presents an approach for reconstructing a surface from a set of unorganized curves. A strategy for updating the reconstructed surface during data acquisition is described as well. Curves are accumulated in a volumetric structure in which a vector field is built and updated. The information that is needed for efficient curve registration is also directly available in this vector field. This leads to a unified modeling approach combining surface reconstruction and curve registration. The algorithm implementing the approach is of linear complexity with respect to the number of input curves and makes it suitable for interactive modeling. Simulated data based on a set of six curvilinear patterns as well as data acquired with a range sensor are used to illustrate the various steps of the algorithm.

关键词： Surface reconstruction Image reconstruction Computational complexity Data acquisition Vectors Optical sensors Robustness Image sensors computer vision Laboratories

来源：评论

学校读者我要写书评

暂无评论

Video-based face recognition using adaptive hidden Markov models

Video-based face recognition using adaptive hidden Markov mo...

引用

conference on computer vision and pattern recognition (cvpr)

作者： Xiaoming Liu Tsuhan Cheng Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA U.S.A. Carnegie Mellon University Pittsburgh PA US Electr. & Comput. Eng. Carnegie Mellon Univ. Pittsburgh PA USA

ISBN: (纸本)0769519008

While traditional face recognition is typically based on still images, face recognition from video sequences has become popular. In this paper, we propose to use adaptive hidden Markov models (HMM) to perform video-based face recognition. During the training process, the statistics of training video sequences of each subject, and the temporal dynamics, are learned by an HMM. During the recognition process, the temporal characteristics of the test video sequence are analyzed over time by the HMM corresponding to each subject. The likelihood scores provided by the HMMs are compared, and the highest score provides the identity of the test video sequence. Furthermore, with unsupervised learning, each HMM is adapted with the test video sequence, which results in better modeling over time. Based on extensive experiments with various databases, we show that the proposed algorithm results in better performance than using majority voting of image-based recognition results.

关键词： Face recognition Hidden Markov models Video sequences Testing Statistics Character recognition Unsupervised learning Image databases Voting Image recognition

来源：评论

学校读者我要写书评

暂无评论

The effects of segmentation and feature choice in a translation model of object recognition

The effects of segmentation and feature choice in a translat...

引用

conference on computer vision and pattern recognition (cvpr)

作者： K. Barnard P. Duygulu R. Guru P. Gabbur D. Forsyth Department of Computing Science University of Arizona Tucson USA Computer Science Division University of California Berkeley USA

We work with a model of object recognition where words must be placed on image regions. This approach means that large scale experiments are relatively easy, so we can evaluate the effects of various early and midlevel vision algorithms on recognition performance. We evaluate various image segmentation algorithms by determining word prediction accuracy for images segmented in various ways and represented by various features. We take the view that good segmentations respect object boundaries, and so word prediction should be better for a better segmentation. However, it is usually very difficult in practice to obtain segmentations that do not break up objects, so most practitioners attempt to merge segments to get better putative object representations. We demonstrate that our paradigm of word prediction easily allows us to predict potentially useful segment merges, even for segments that do not look similar (for example, merging the black and white halves of a penguin is not possible with feature-based segmentation; the main cue must be "familiar configuration"). These studies focus on unsupervised learning of recognition. However, we show that word prediction can be markedly improved by providing supervised information for a relatively small number of regions together with large quantities of unsupervised information. This supervisory information allows a better and more discriminative choice of features and breaks possible symmetries.

关键词： Object recognition Probability distribution Labeling computer vision Shape Frequency Gaussian processes computer science computer society pattern recognition

来源：评论

学校读者我要写书评

暂无评论

PAMPAS: real-valued graphical models for computer vision

PAMPAS: real-valued graphical models for computer vision

引用

conference on computer vision and pattern recognition (cvpr)

作者： M. Isard Microsoft Research Limited Mountain View CA USA

Probabilistic models have been adopted for many computer vision applications, however inference in high-dimensional spaces remains problematic. As the state-space of a model grows, the dependencies between the dimensions lead to an exponential growth in computation when performing inference. Many common computer vision problems naturally map onto the graphical model framework; the representation is a graph where each node contains a portion of the state-space and there is an edge between two nodes only if they are not independent conditional on the other nodes in the graph. When this graph is sparsely connected, belief propagation algorithms can turn an exponential inference computation into one, which is linear in the size of the graph. However belief propagation is only applicable when the variables in the nodes are discrete-valued or jointly represented by a single multivariate Gaussian distribution, and this rules out many computer vision applications. This paper combines belief propagation with ideas from particle filtering; the resulting algorithm performs inference on graphs containing both cycles and continuous-valued latent variables with general conditional probability distributions. Such graphical models have wide applicability in the computer vision domain and we test the algorithm on example problems of low-level edge linking and locating jointed structures in clutter.

关键词： Graphical models computer vision Belief propagation Inference algorithms Application software Gaussian distribution Filtering algorithms Probability distribution Testing Joining processes

来源：评论

学校读者我要写书评

暂无评论

A novel convergence scheme for active appearance models

A novel convergence scheme for active appearance models

引用

conference on computer vision and pattern recognition (cvpr)

作者： A. Umit Batur H.H. Monson School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA Georgia Institute of Technology Atlanta GA US Sch. of Electr. & Comput. Eng. Georgia Inst. of Technol. Atlanta GA USA

The active appearance model (AAM) algorithm is a powerful tool for modeling images of deformable objects. AAM combines a subspace-based deformable model of an object's appearance with a fast and robust method of fitting this model to a previously unseen image. The speed of this algorithm comes from the assumption that the gradient matrix is fixed around the optimal coefficients for all images. In this paper, we propose a convergence scheme for AAM that adapts this gradient matrix to the target image's texture during convergence by adding linear modes of change that are based on the texture eigenvectors of AAM. We show that this adaptive strategy for the gradient matrix provides a significant increase in the performance of the AAM algorithm.

关键词： Convergence Active appearance model Shape Principal component analysis Deformable models Robustness Power engineering computing Power engineering and energy Target tracking Face recognition

来源：评论

学校读者我要写书评

暂无评论

Eye gaze tracking using an active stereo head

Eye gaze tracking using an active stereo head

引用

conference on computer vision and pattern recognition (cvpr)

作者： D. Beymer M. Flickner IBM Almaden Research Center San Jose CA USA

In the eye gaze tracking problem, the goal is to determine where on a monitor screen a computer user is looking, ie., the gaze point. Existing systems generally have one of two limitations: either the head must remain fixed in front of a stationary camera, or, to allow for head motion, the user must wear an obstructive device. We introduce a 3D eye tracking system where the head motion is allowed without the need for markers or worn devices. We use a pair of stereo systems: a wide angle stereo system detects the face and steers an active narrow FOV stereo system to track the eye at high resolution. For high resolution tracking, the eye is modeled in 3D, including the corneal ball, pupil and fovea. We discuss the calibration of the stereo systems, the eye model, eye detection and tracking, and we close with an evaluation of the accuracy of the estimated gaze point on the monitor.

关键词： Head Stereo vision Cameras Tracking Face detection computerized monitoring Application software Hardware Calibration computer displays

来源：评论

学校读者我要写书评

暂无评论

Spacetime stereo: a unifying framework for depth from triangulation

Spacetime stereo: a unifying framework for depth from triang...

引用

conference on computer vision and pattern recognition (cvpr)

作者： J. Davis R. Ramamoorthi S. Rusinkiewicz Honda Research Institute USA Columbia University USA Princeton University USA

Depth from triangulation has traditionally been treated in a number of separate threads in the computer vision literature, with methods like stereo, laser scanning, and coded structured light considered separately. In this paper, we propose a common framework, spacetime stereo, which unifies many of these previous methods. Viewing specific techniques as special cases of this general framework leads to insights regarding the solutions to many of the traditional problems of individual techniques. Specifically, we discuss a number of innovative possible applications such as improved recovery of static scenes under variable illumination, spacetime stereo for moving objects, structured light and laser scanning with multiple simultaneous stripes or patterns, and laser scanning of shiny objects. To suggest the practical utility of the framework, we use it to analyze one of these applications: recovery of static scenes under variable, but uncontrolled, illumination. Based on our analysis, we show that methods derived from the spacetime stereo framework can be used to recover depth in situations in which existing methods perform poorly.

关键词： Stereo vision Layout Lighting Stereo image processing Yarn computer vision Computational geometry Performance analysis Orbital robotics Robot vision systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 463 464 465 466 467 468 469 470 471 472 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：