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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4721-4730 订阅

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

详细简洁

排序：

Shape correspondence through landmark sliding

Shape correspondence through landmark sliding

引用

conference on computer vision and pattern recognition (cvpr)

作者： Song Wang T. Kubota T. Richardson Department of Computer Science and Engineering University of South Carolina Columbia SC USA

Motivated by improving statistical shape analysis, this paper presents a novel landmark-based method for accurate shape correspondence, where the general goal is to align multiple shape instances by corresponding a set of given landmark points along those shapes. Different from previous methods, we consider both global shape deformation and local geometric features in defining the shape-correspondence cost function to achieve a consistency between the landmark correspondence and the underlying shape correspondence. According to this cost function, we develop a novel landmark-sliding algorithm to achieve optimal landmark-based shape correspondence with preserved shape topology. The proposed method can be applied to correspond various 2D shapes in the forms of single closed curves, single open curves, self-crossing curves, and multiple curves. We also discuss the practical issue of landmark initialization. The proposed method has been tested on various biological shapes arising from medical image analysis and validated in constructing statistical shape models.

关键词： Shape measurement Cost function Topology Biomedical imaging Image analysis Application software computer science Medical tests Biological system modeling computer vision

来源：评论

学校读者我要写书评

暂无评论

Efficient belief propagation for early vision

Efficient belief propagation for early vision

引用

conference on computer vision and pattern recognition (cvpr)

作者： P.F. Felzenszwalb D.R. Huttenlocher Department of Computer Science Cornell University USA

Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph cuts and belief propagation yield accurate results, but despite recent advances are often still too slow for practical use. In this paper we present new algorithmic techniques that substantially improve the running time of the belief propagation approach. One of our techniques reduces the complexity of the inference algorithm to be linear rather than quadratic in the number of possible labels for each pixel, which is important for problems such as optical flow or image restoration that have a large label set. A second technique makes it possible to obtain good results with a small fixed number of message passing iterations, independent of the size of the input images. Taken together these techniques speed up the standard algorithm by several orders of magnitude. In practice we obtain stereo, optical flow and image restoration algorithms that are as accurate as other global methods (e.g., using the Middlebury stereo benchmark) while being as fast as local techniques.

关键词： Belief propagation Image restoration Image motion analysis Optical sensors Costs Inference algorithms Markov random fields Robustness Pixel Labeling

来源：评论

学校读者我要写书评

暂无评论

Faster graph-theoretic image processing via small-world and quadtree topologies

Faster graph-theoretic image processing via small-world and ...

引用

conference on computer vision and pattern recognition (cvpr)

作者： L. Grady E.L. Schwartz Imaging and Visualization Department Siemens AG Corporate Research and Development Princeton NJ USA Department of Cognitive and Neural Systems Boston university Boston MA USA Department of Congnitive and Neural Systems and Electrical and Computer Engineering Boston University Boston MA USA

Numerical methods associated with graph-theoretic image processing algorithms often reduce to the solution of a large linear system. We show here that choosing a topology that yields a small graph diameter can greatly speed up the numerical solution. As a proof of concept, we examine two image graphs that preserve local connectivity of the nodes (pixels) while drastically reducing the graph diameter. The first is based on a "small-world" modification of a standard 4-connected lattice. The second is based on a quadtree graph. Using a recently described graph- theoretic image processing algorithm we show that large speed-up is achieved with a minimal perturbation of the solution when these graph topologies are utilized. We suggest that a variety of similar algorithms may also benefit from this approach.

关键词： Image processing Topology Linear systems Pixel Lattices

来源：评论

学校读者我要写书评

暂无评论

Spherical harmonics vs. Haar wavelets: basis for recovering illumination from cast shadows

Spherical harmonics vs. Haar wavelets: basis for recovering ...

引用

conference on computer vision and pattern recognition (cvpr)

作者： T. Okabe I. Sato Y. Sato Institute of Industrial Science The University of Tokyo Meguro-ku Tokyo Japan

The problem of estimating an illumination distribution from images is called inverse lighting. For inverse lighting, three approaches have been developed based on specular reflection components, diffuse reflection components, and cast shadows. The present study provides theoretical insights as to why the approach based on cast shadows works in a reliable manner, and discusses what kind of basis functions are appropriate to be used for recovering illumination from cast shadows. First, we formalize the approach based on cast shadows by using spherical harmonics. Then, we analyze the approach in the frequency domain and show the advantages and the limitations of the approach. Second, motivated by the observations in the frequency domain, we propose an efficient method using Haar wavelets that provide compact supports and sparsity of coefficients. Finally, we report the results of experiments that compared the method using spherical harmonics and the method using Haar wavelets.

关键词： Lighting Optical reflection Frequency domain analysis Frequency estimation Reliability theory Layout Harmonic analysis Wavelet domain Light sources Face recognition

来源：评论

学校读者我要写书评

暂无评论

Scalable discriminant feature selection for image retrieval and recognition

Scalable discriminant feature selection for image retrieval ...

引用

conference on computer vision and pattern recognition (cvpr)

作者： N. Vasconcelos M. Vasconcelos Statistical Visual Computing Laboratory University of California San Diego USA Harvard Robotics Laboratory Harvard University USA

Problems such as object recognition or image retrieval require feature selection (FS) algorithms that scale well enough to be applicable to databases containing large numbers of image classes and large amounts of data per class. We exploit recent connections between information theoretic feature selection and minimum Bayes error solutions to derive FS algorithms that are optimal in a discriminant sense without compromising scalability. We start by formalizing the intuition that optimal FS must favor discriminant features while penalizing discriminant features that are redundant. We then rely on this result to derive a new family of FS algorithms that enables an explicit trade-off between complexity and classification optimality. This trade-off is controlled by a parameter that encodes the order of feature redundancies that must be explicitly modeled to achieve the optimal solution. Experimental results on databases of natural images show that this order is usually low, enabling optimal FS with very low complexity.

关键词： Image retrieval Image recognition Scalability Laboratories Information retrieval Image databases Spatial databases Face detection Large-scale systems Biology computing

来源：评论

学校读者我要写书评

暂无评论

Video repairing: inference of foreground and background under severe occlusion

Video repairing: inference of foreground and background unde...

引用

conference on computer vision and pattern recognition (cvpr)

作者： Jiaya Jia W. Tai-Pang Yu-Wing Tai Chi-Keung Tang Vision and Graphics Group Hong Kong University of Science and Technology Hong Kong China Hong Kong University of Science and Technology Kowloon HK Dept. of Comput. Sci. Hong Kong Univ. of Sci. & Technol. China

We propose a new method, video repairing, to robustly infer missing static background and moving foreground due to severe damage or occlusion from a video. To recover background pixels, we extend the image repairing method, where layer segmentation and homography blending are used to preserve temporal coherence and avoid flickering. By exploiting the constraint imposed by periodic motion and a subclass of camera and object motions, we adopt a two-phase approach to repair moving foreground pixels: In the sampling phase, motion data are sampled and regularized by 3D tensor voting to maintain temporal coherence and motion periodicity. In the alignment phase, missing moving foreground pixels are inferred by spatial and temporal alignment of the sampled motion data at multiple scales. We experimented our system with some difficult examples, where the camera can be stationary or in motion.

关键词： Cameras Image restoration Image segmentation Image sampling computer graphics computer science Robustness Pixel Tensile stress Voting

来源：评论

学校读者我要写书评

暂无评论

Incremental density approximation and kernel-based Bayesian filtering for object tracking

Incremental density approximation and kernel-based Bayesian ...

引用

conference on computer vision and pattern recognition (cvpr)

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

Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The particle filter (condensation) algorithm provides a general framework for estimating the probability density functions (pdf) of general non-linear and non-Gaussian systems. However, since this algorithm is based on a Monte Carlo approach, where the density is represented by a set of random samples, the number of samples is problematic, especially for high dimensional problems. In this paper, we propose an alternative to the classical particle filter in which the underlying pdf is represented with a semi-parametric method based on a mode finding algorithm using mean-shift. A mode propagation technique is designed for this new representation for tracking applications. A quasi-random sampling method in the measurement stage is used to improve performance, and sequential density approximation for the measurements distribution is performed for efficient computation. We apply our algorithm to a high dimensional color-based tracking problem, and demonstrate its performance by showing competitive results with other trackers.

关键词： Bayesian methods Filtering Motion estimation Particle filters Density measurement computer vision Application software Tracking Probability density function Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Real-time combined 2D+3D active appearance models

Real-time combined 2D+3D active appearance models

引用

conference on computer vision and pattern recognition (cvpr)

作者： Jing Xiao S. Baker I. Matthews T. Kanade The Robotics Institute Carnegie Mellon University Pittsburgh PA USA The Robotics Institute Carnegie Mellon University Pittsburgh PA

Active appearance models (AAMs) are generative models commonly used to model faces. Another closely related types of face models are 3D morphable models (3DMMs). Although AAMs are 2D, they can still be used to model 3D phenomena such as faces moving across pose. We first study the representational power of AAMs and show that they can model anything a 3DMM can, but possibly require more shape parameters. We quantify the number of additional parameters required and show that 2D AAMs can generate model instances that are not possible with the equivalent 3DMM. We proceed to describe how a non-rigid structure-from-motion algorithm can be used to construct the corresponding 3D shape modes of a 2D AAM. We then show how the 3D modes can be used to constrain the AAM so that it can only generate model instances that can also be generated with the 3D modes. Finally, we propose a real-time algorithm for fitting the AAM while enforcing the constraints, creating what we call a "combined 2D+3D AAM".

关键词： computer society computer vision pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A new GPCA algorithm for clustering subspaces by fitting, differentiating and dividing polynomials

A new GPCA algorithm for clustering subspaces by fitting, di...

引用

conference on computer vision and pattern recognition (cvpr)

作者： R. Vidal Yi Ma J. Piazzi Center for Imaging Science Johns Hopkins University USA Electrical & Computer Engineering University of Illinois Urbana-Champaign USA Mechanical Engineering Johns Hopkins University USA

We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of polynomials whose derivatives at a data point give normal vectors to the subspace associated with the data point. Since the polynomials can be estimated linearly from data subspace clustering is reduced to classifying one point per subspace. We do so by choosing points in the data set that minimize a distance function. A basis for the complement of each subspace is then recovered by applying standard PCA to the set of derivatives (normal vectors) at those points. The final result is a new GPCA algorithm for subspace clustering based on simple linear and polynomial algebra. Our experiments show that our method outperforms existing algebraic algorithms based on polynomial factorization and provides a good initialization to iterative techniques such as K-subspace and EM. We also present applications of GPCA on computer vision problems such as vanishing point detection, face clustering, and news video segmentation.

关键词： Clustering algorithms Polynomials Iterative algorithms Face detection Principal component analysis Vectors Algebra Iterative methods Application software computer vision

来源：评论

学校读者我要写书评

暂无评论

The multibody trifocal tensor: motion segmentation from 3 perspective views

The multibody trifocal tensor: motion segmentation from 3 pe...

引用

conference on computer vision and pattern recognition (cvpr)

作者： R. Hartley R. Vidal NICTA Australia Department of Systems Engineering Australian National University Australia Center for Imaging Science Johns Hopkins University USA

We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the correspondences they become related by the so-called multibody trilinear constraint and its associated multibody trifocal tensor We show how to linearly estimate the multibody trifocal tensor from point-point-point correspondences. We then show that one can estimate the epipolar lines associated with each image point from the common root of a set of univariate polynomials and the epipoles by solving a plane clustering problem in /spl Ropf//sup 3/ using GPCA. The individual trifocal tensors are then obtained from the second order derivatives of the multibody trilinear constraint. Given epipolar lines and epipoles, or trifocal tensors, we obtain an initial clustering of the correspondences, which we use to initialize an iterative algorithm that finds an optimal estimate for the trifocal tensors and the clustering of the correspondences using Expectation Maximization. We test our algorithm on real and synthetic dynamic scenes.

关键词： Tensile stress Motion segmentation computer vision Polynomials Iterative algorithms Layout Geometry Motion estimation Clustering algorithms Cameras

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 469 470 471 472 473 474 475 476 477 478 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：