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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,810 篇 会议
36 篇 期刊文献
12 册 图书

馆藏范围

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

日期分布

学科分类号

4,042 篇 工学
- 3,808 篇 计算机科学与技术...
- 1,615 篇 软件工程
- 847 篇 光学工程
- 383 篇 信息与通信工程
- 286 篇 控制科学与工程
- 212 篇 机械工程
- 189 篇 电气工程
- 97 篇 生物医学工程（可授...
- 80 篇 电子科学与技术（可...
- 79 篇 生物工程
- 62 篇 仪器科学与技术
- 39 篇 力学（可授工学、理...
- 38 篇 建筑学
- 37 篇 土木工程
- 34 篇 航空宇航科学与技...
- 29 篇 安全科学与工程
- 24 篇 测绘科学与技术
- 23 篇 交通运输工程
- 22 篇 化学工程与技术
1,618 篇 理学
- 1,021 篇 物理学
- 1,005 篇 数学
- 379 篇 统计学（可授理学、...
- 160 篇 生物学
- 38 篇 系统科学
- 27 篇 化学
185 篇 管理学
- 132 篇 图书情报与档案管...
- 56 篇 管理科学与工程(可...
- 32 篇 工商管理
153 篇 医学
- 153 篇 临床医学
- 22 篇 基础医学(可授医学...
18 篇 法学
11 篇 教育学
10 篇 农学
7 篇 经济学
2 篇 军事学
1 篇 艺术学

主题

2,394 篇 computer vision
879 篇 pattern recognit...
667 篇 cameras
663 篇 computer science
633 篇 face recognition
577 篇 layout
550 篇 image segmentati...
524 篇 conferences
520 篇 shape
479 篇 object recogniti...
470 篇 robustness
411 篇 humans
354 篇 feature extracti...
338 篇 object detection
308 篇 training
278 篇 application soft...
270 篇 image recognitio...
263 篇 lighting
241 篇 image reconstruc...
236 篇 computational mo...

机构

43 篇 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...
18 篇 the robotics ins...
17 篇 department of in...
17 篇 robotics institu...
17 篇 institute of com...
16 篇 univ sci & techn...
15 篇 tsinghua univ pe...
14 篇 department of el...
14 篇 computer vision ...
14 篇 school of comput...
14 篇 microsoft resear...
14 篇 school of comput...
13 篇 univ maryland co...

作者

39 篇 timofte radu
28 篇 s.k. nayar
26 篇 huang thomas s.
24 篇 xiaoou tang
24 篇 t. kanade
21 篇 t.s. huang
20 篇 van gool luc
20 篇 chellappa rama
19 篇 nayar shree k.
19 篇 t. darrell
17 篇 li stan z.
17 篇 torralba antonio
17 篇 a.k. jain
17 篇 a. zisserman
17 篇 jain anil k.
16 篇 m. hebert
16 篇 g. healey
16 篇 heung-yeung shum
16 篇 zisserman andrew
15 篇 m. shah

语言

6,856 篇 英文
2 篇 中文
1 篇 土耳其文

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

共 6858 条记录，以下是4911-4920 订阅

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

详细简洁

排序：

3D Face recognition using Mapped Depth Images

3D Face Recognition using Mapped Depth Images

引用

ieee computer society conference on computer vision and pattern recognition Workshops (cvprW)

作者： Gang Pan Shi Han Zhaohui Wu Yueming Wang Department of Computer Science University of Zhejiang Hangzhou China

This paper addresses 3D face recognition from facial shape. Firstly, we present an effective method to automatically extract ROI of facial surface, which mainly depends on automatic detection of facial bilateral symmetry plane and localization of nose tip. Then we build a reference plane through the nose tip for calculating the relative depth values. Considering the non-rigid property of facial surface, the ROI is triangulated and parameterized into an isomorphic 2D planar circle, attempting to preserve the intrinsic geometric properties. At the same time the relative depth values are also mapped. Finally we perform eigenface on the mapped relative depth image. The entire scheme is insensitive to pose variance. The experiment using FRGC database v1.0 obtains the rank-1 identification score of 95%, which outperforms the result of the PCA base-line method by 4%, which demonstrates the effectiveness of our algorithm.

关键词： Face recognition Shape Nose Face detection Humans Robustness computer science Image databases Spatial databases Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Learning spatiotemporal T-junctions for occlusion detection

Learning spatiotemporal T-junctions for occlusion detection

引用

conference on computer vision and pattern recognition (cvpr)

作者： N. Apostoloff A. Fitzgibbon Robotics Research Group University of Oxford Oxford UK

The goal of motion segmentation and layer extraction can be viewed as the detection and localization of occluding surfaces. A feature that has been shown to be a particularly strong indicator of occlusion, in both computer vision and neuroscience, is the T-junction; however, little progress has been made in T-junction detection. One reason for this is the difficulty in distinguishing false T-junctions (i.e. those not on an occluding edge) and real T-junctions in cluttered images. In addition to this, their photometric profile alone is not enough for reliable detection. This paper overcomes the first problem by searching for T-junctions not in space, but in space-time. This removes many false T-junctions and creates a simpler image structure to explore. The second problem is mitigated by learning the appearance of T-junctions in these spatiotemporal images. An RVM T-junction classifier is learnt from hand-labelled data using SIFT to capture its redundancy. This detector is then demonstrated in a novel occlusion detector that fuses Canny edges and T-junctions in the spatiotemporal domain to detect occluding edges in the spatial domain.

关键词： Spatiotemporal phenomena Image edge detection computer vision Detectors Motion segmentation Motion detection Neuroscience Photometry Redundancy Fuses

来源：评论

学校读者我要写书评

暂无评论

Shape matching and object recognition using low distortion correspondences

Shape matching and object recognition using low distortion c...

引用

conference on computer vision and pattern recognition (cvpr)

作者： A.C. Berg T.L. Berg J. Malik Department of Electrical Engineering and Computer Science University of California Berkeley USA

We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of corresponding geometric blur point descriptors as well as the geometric distortion between pairs of corresponding feature points. The algorithm handles outliers, and thus enables matching of exemplars to query images in the presence of occlusion and clutter. Given the correspondences, we estimate an aligning transform, typically a regularized thin plate spline, resulting in a dense correspondence between the two shapes. Object recognition is then handled in a nearest neighbor framework where the distance between exemplar and query is the matching cost between corresponding points. We show results on two datasets. One is the Caltech 101 dataset (Fei-Fei, Fergus and Perona), an extremely challenging dataset with large intraclass variation. Our approach yields a 48% correct classification rate, compared to Fei-Fei et al 's 16%. We also show results for localizing frontal and profile faces that are comparable to special purpose approaches tuned to faces.

关键词： Shape Object recognition computer vision Algorithms Deformable models Quadratic programming Cost function Spline Nearest neighbor searches Face detection

来源：评论

学校读者我要写书评

暂无评论

Reconstructing open surfaces from unorganized data points

Reconstructing open surfaces from unorganized data points

引用

conference on computer vision and pattern recognition (cvpr)

作者： J.E. Solem A. Heyden School of Technology and Society Malmö University Sweden

In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curve, representing the boundary, on the implicitly defined surface. This curve is given as the intersection of the level set describing the surface and an auxiliary level set. These two level sets are propagated using the same motion vector field. Special care has to be taken in order for the surfaces not to intersect at other places than at the desired boundary. Methods for accomplishing this are presented and a novel fast scheme for finding good initial values is proposed. This novel method gives a piecewise linear approximation of the initial surface boundary using a partition of the convex hull. With the described method open surfaces can be fitted to point clouds obtained using structure from motion techniques. This paper solves an important practical problem since in many cases the surfaces in the scene are open or can only be viewed from certain directions. Successful experiments on several data sets support the method.

关键词： Surface reconstruction Surface fitting Level set Image reconstruction Layout Cameras Clouds computer vision Surface treatment Vectors

来源：评论

学校读者我要写书评

暂无评论

The alignment of objects with smooth surfaces: error analysis of the curvature method

The alignment of objects with smooth surfaces: error analysi...

引用

conference on computer vision and pattern recognition (cvpr)

作者： R. Basri M. I. T. A. I. Laboratory Cambridge MA USA

The recognition of objects with smooth bounding surfaces from their contour images is addressed. In particular, the curvature method is applied to ellipsoidal objects and the error for different rotations of the objects is computed analytically. It is seen that the error depends on the exact shape of the ellipsoid (namely, the relative lengths of its axes), and it increases as the ellipsoid becomes elongated in the Z-direction. It is shown that the errors are usually small, and that, in general, a small number of models is required to predict the appearance of an ellipsoid from all possible views.< >

关键词： Error analysis Ellipsoids Shape Laboratories Predictive models Image recognition Object recognition Neuroscience Artificial intelligence Contracts

来源：评论

学校读者我要写书评

暂无评论

Kernel-based Bayesian filtering for object tracking

Kernel-based Bayesian filtering for object tracking

引用

conference on computer vision and pattern recognition (cvpr)

作者： Bohyung Han Ying Zhu D. Comaniciu L. Davis Department of Computer Science University of Maryland College Park MD USA Real-Time Vision and Modeling Siemens Corporate Research Inc. Princeton NJ USA Integrated Data and Systems Siemens Corporate Research Inc. Princeton NJ USA

Particle filtering provides a general framework for propagating probability density functions in nonlinear and non-Gaussian systems. However, the algorithm is based on a Monte Carlo approach and sampling is a problematic issue, especially for high dimensional problems. This paper presents a new kernel-based Bayesian filtering framework, which adopts an analytic approach to better approximate and propagate density functions. In this framework, the techniques of density interpolation and density approximation are introduced to represent the likelihood and the posterior densities by Gaussian mixtures, where all parameters such as the number of mixands, their weight, mean, and covariance are automatically determined. The proposed analytic approach is shown to perform sampling more efficiently in high dimensional space. We apply our algorithm to real-time tracking problems, and demonstrate its performance on real video sequences as well as synthetic examples.

关键词： Bayesian methods Density functional theory Sampling methods Interpolation Monte Carlo methods Filtering algorithms Kernel computer vision Density measurement computer science

来源：评论

学校读者我要写书评

暂无评论

A Measure for Objective Evaluation of Image Segmentation Algorithms

A Measure for Objective Evaluation of Image Segmentation Alg...

引用

ieee computer society conference on computer vision and pattern recognition Workshops (cvprW)

作者： R. Unnikrishnan C. Pantofaru M. Hebert The Robotics Institute Carnegie Mellon University Pittsburgh PA USA

Despite significant advances in image segmentation techniques, evaluation of these techniques thus far has been largely subjective. Typically, the effectiveness of a new algorithm is demonstrated only by the presentation of a few segmented images and is otherwise left to subjective evaluation by the reader. Little effort has been spent on the design of perceptually correct measures to compare an automatic segmentation of an image to a set of hand-segmented examples of the same image. This paper demonstrates how a modification of the Rand index, the Normalized Probabilistic Rand (NPR) index, meets the requirements of largescale performance evaluation of image segmentation. We show that the measure has a clear probabilistic interpretation as the maximum likelihood estimator of an underlying Gibbs model, can be correctly normalized to account for the inherent similarity in a set of ground truth images, and can be computed efficiently for large datasets. Results are presented on images from the publicly available Berkeley Segmentation dataset.

关键词： Image segmentation Humans Robots Maximum likelihood detection Maximum likelihood estimation Machine vision Target tracking Shape Clustering algorithms Image databases

来源：评论

学校读者我要写书评

暂无评论

Patch-based convolutional neural network for whole slide tissue image classification

Patch-based convolutional neural network for whole slide tis...

引用

2016 ieee conference on computer vision and pattern recognition, cvpr 2016

作者： Hou, Le Samaras, Dimitris Kurc, Tahsin M. Gao, Yi Davis, James E. Saltz, Joel H. Dept. of Computer Science Stony Brook University United States Dept. of Biomedical Informatics Stony Brook University United States Dept. of Applied Mathematics and Statistics Stony Brook University United States Oak Ridge National Laboratory United States Dept. of Pathology Stony Brook Hospital United States Cancer Center Stony Brook Hospital United States

ISBN: (纸本)9781467388511

Convolutional Neural Networks (CNN) are state-of-theart models for many image classification tasks. However, to recognize cancer subtypes automatically, training a CNN on gigapixel resolution Whole Slide Tissue Images (WSI) is currently computationally impossible. The differentiation of cancer subtypes is based on cellular-level visual features observed on image patch scale. Therefore, we argue that in this situation, training a patch-level classifier on image patches will perform better than or similar to an image-level classifier. The challenge becomes how to intelligently combine patch-level classification results and model the fact that not all patches will be discriminative. We propose to train a decision fusion model to aggregate patch-level predictions given by patch-level CNNs, which to the best of our knowledge has not been shown before. Furthermore, we formulate a novel Expectation-Maximization (EM) based method that automatically locates discriminative patches robustly by utilizing the spatial relationships of patches. We apply our method to the classification of glioma and non-small-cell lung carcinoma cases into subtypes. The classification accuracy of our method is similar to the inter-observer agreement between pathologists. Although it is impossible to train CNNs on WSIs, we experimentally demonstrate using a comparable non-cancer dataset of smaller images that a patch-based CNN can outperform an image-based CNN.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Syntactic pattern classification by branch and bound search

Syntactic pattern classification by branch and bound search

引用

conference on computer vision and pattern recognition (cvpr)

作者： A.Y. Commike J.J. Hull Department of Computer Science State University of New York University at Buffalo Buffalo NY USA

A methodology for classifying syntactic patterns that performs a branch-and-bound search over a set of prototypes is proposed. The prototypes are first clustered hierarchically and the search is performed over the hierarchy. The proposed technique is applied to a pattern recognition system in which images are described by the sequence of features extracted from the chain codes of their contours. A rotationally invariant string distance measure is defined that compares two feature strings. The methodology discussed is compared to a nearest neighbor classifier that uses 12000 prototypes. The proposed technique decreases the time required to recognize a pattern by 93% and maintains a recognition rate of greater than 90%.< >

关键词： pattern classification pattern recognition Prototypes Nearest neighbor searches Character recognition Training data computer science Feature extraction Rotation measurement

来源：评论

学校读者我要写书评

暂无评论

Real-time tracking with multiple cues by set theoretic random search

Real-time tracking with multiple cues by set theoretic rando...

引用

conference on computer vision and pattern recognition (cvpr)

作者： Cheng Chang R. Ansari Microsoft Corporation USA ECE Department University of Illinois Chicago IL USA

Conventional treatment of visual tracking has been to optimize an objective function in a probabilistic framework. In this formulation, efficient algorithms employing simple prior distributions are usually insufficient to handle clutters (e.g., Kalman filter). On the other hand, distributions that are complex enough to incorporate all a priori knowledge can make the problem computationally intractable (e.g., particle filters (PF)). This paper proposes a new formulation of visual tracking where every piece of information, be it from a priori knowledge or observed data, is represented by a set in the solution space and the intersection of these sets, the feasibility set, represents all acceptable solutions. Based on this formulation, we propose an algorithm whose objective is to find a solution in the feasibility set. We show that this set theoretic tracking algorithm performs effective face tracking and is computationally more efficient than standard PF-based tracking.

关键词： Target tracking Particle filters Bayesian methods Stochastic processes computer vision Robustness Shape measurement Particle tracking Optimization methods Distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 488 489 490 491 492 493 494 495 496 497 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：