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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

8,901 篇 会议
43 篇 期刊文献
18 册 图书

馆藏范围

8,961 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

4,560 篇 工学
- 4,020 篇 计算机科学与技术...
- 2,178 篇 软件工程
- 1,241 篇 光学工程
- 555 篇 控制科学与工程
- 431 篇 信息与通信工程
- 430 篇 机械工程
- 294 篇 电气工程
- 287 篇 仪器科学与技术
- 179 篇 生物工程
- 159 篇 生物医学工程（可授...
- 119 篇 电子科学与技术（可...
- 61 篇 安全科学与工程
- 58 篇 建筑学
- 58 篇 化学工程与技术
- 52 篇 土木工程
- 49 篇 交通运输工程
- 40 篇 力学（可授工学、理...
2,065 篇 理学
- 1,382 篇 物理学
- 1,198 篇 数学
- 420 篇 统计学（可授理学、...
- 238 篇 生物学
- 54 篇 化学
- 36 篇 系统科学
263 篇 管理学
- 180 篇 图书情报与档案管...
- 89 篇 管理科学与工程(可...
- 47 篇 工商管理
223 篇 医学
- 222 篇 临床医学
- 39 篇 基础医学(可授医学...
205 篇 艺术学
- 205 篇 设计学（可授艺术学...
45 篇 法学
- 43 篇 社会学
21 篇 农学
14 篇 教育学
9 篇 经济学
6 篇 军事学

主题

3,412 篇 computer vision
1,216 篇 pattern recognit...
946 篇 cameras
908 篇 conferences
765 篇 computer science
674 篇 image segmentati...
618 篇 layout
598 篇 training
548 篇 shape
518 篇 robustness
451 篇 feature extracti...
448 篇 humans
445 篇 face recognition
405 篇 computational mo...
402 篇 object detection
365 篇 visualization
356 篇 computer archite...
336 篇 application soft...
304 篇 lighting
259 篇 image reconstruc...

机构

41 篇 microsoft resear...
30 篇 department of co...
25 篇 department of co...
23 篇 institute for co...
22 篇 department of co...
22 篇 school of comput...
20 篇 university of sc...
20 篇 swiss fed inst t...
19 篇 tsinghua univers...
19 篇 institute of com...
18 篇 swiss fed inst t...
17 篇 the robotics ins...
17 篇 carnegie mellon ...
17 篇 computer vision ...
17 篇 department of co...
16 篇 institute of inf...
16 篇 school of comput...
15 篇 school of comput...
15 篇 carnegie mellon ...
14 篇 national laborat...

作者

57 篇 timofte radu
25 篇 huang thomas s.
24 篇 van gool luc
23 篇 s.k. nayar
22 篇 nayar shree k.
22 篇 t. kanade
21 篇 jain anil k.
20 篇 luc van gool
19 篇 t.s. huang
18 篇 xiaoou tang
18 篇 murino vittorio
18 篇 horst bischof
17 篇 a.k. jain
17 篇 t. darrell
16 篇 g. healey
16 篇 bowyer kevin w.
16 篇 bischof horst
15 篇 m.j. black
15 篇 li stan z.
15 篇 m. shah

语言

8,932 篇 英文
21 篇 其他
8 篇 中文
1 篇 土耳其文

检索条件"任意字段=IEEE-Computer-Society Conference on Computer Vision and Pattern Recognition Workshops"

共 8962 条记录，以下是4861-4870 订阅

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

详细简洁

排序：

Lensless imaging with a controllable aperture

Lensless imaging with a controllable aperture

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Zomet, Assaf Nayar, Shree K. Computer Science Department Columbia University New York NY 10027 HumanEyes Technologies

ISBN: (纸本)0769525970

In this paper we propose a novel, highly flexible camera. The camera consists of an image detector and a special aperture, but no lens. The aperture is a set of parallel light attenuating layers whose transmittances are controllable in space and time. By applying different transmittance patterns to this aperture, it is possible to modulate the incoming light in useful ways and capture images that are impossible to capture with conventional lens-based cameras. For example, the camera can pan and tilt its field of view without the use of any moving parts. It can also capture disjoint regions of interest in the scene without having to capture the regions in between them. In addition, the camera can be used as a computational sensor, where the detector measures the end result of computations performed by the attenuating layers on the scene radiance values. These and other imaging functionalities can be implemented with the same physical camera and the functionalities can be switched from one video frame to the next via software. We have built a prototype camera based on this approach using a bare image detector and a liquid crystal modulator for the aperture. We discuss in detail the merits and limitations of lensless imaging using controllable apertures. © 2006 ieee.

关键词： Imaging systems

来源：评论

学校读者我要写书评

暂无评论

Shape topics: A compact representation and new algorithms for 3D partial shape retrieval

Shape topics: A compact representation and new algorithms fo...

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Yi, Liu Hongbin, Zha Hong, Qin National Laboratory on Machine Perception Peking University Department of Computer Science State University of New York Stony Brook

ISBN: (纸本)0769525970

This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model. After vector quantization, these features are represented by using a bag-of-words model. The main contributions of this paper are three-fold as follows: 1) a partial shape dissimilarity measure is proposed to rank shapes according to their distances to the input query, without using any time-consuming alignment procedure;2) by applying the probabilistic text analysis technique, a highly compact representation "Shape Topics" and accompanying algorithms are developed for efficient 3D partial shape retrieval, the mapping from "Shape Topics" to "object categories" is established using multi-class SVMs;and 3) a method for evaluating the performance of partial shape retrieval is proposed and tested. To our best knowledge, very few existing methods are able to perform well online partial shape retrieval for large 3D shape repositories. Our experimental results are expected to validate the efficacy and effectiveness of our novel approach. © 2006 ieee.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Body localization in still images using hierarchical models and hybrid search

Body localization in still images using hierarchical models ...

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Zhang, Jiayong Luo, Jiebo Collins, Robert Liu, Yanxi Robotics Institute Carnegie Mellon Univ. PA Kodak Research Lab. Eastman Kodak Co. NY Dept. of Computer Science and Eng. Pennsylvania State Univ. PA

ISBN: (纸本)0769525970

We present a 3-level hierarchical model for localizing human bodies in still images from arbitrary viewpoints. We first fit a simple tree-structured model defined on a small landmark set along the body contours by Dynamic Programming (DP). The output is a series of proposal maps that encode the probabilities of partial body configurations. Next, we fit a mixture of view-dependent models by Sequential Monte Carlo (SMC), which handles self-occlusion, anthropometric constraints, and large viewpoint changes. DP and SMC are designed to search in opposite directions such that the DP proposals are utilized effectively to initialize and guide the SMC inference. This hybrid strategy of combining deterministic and stochastic search ensures both the robustness and efficiency of DP, and the accuracy of SMC. Finally, we fit an expanded mixture model with increased landmark density through local optimization. The model hierarchy is trained on a large number of gait images. Extensive tests on cluttered images with varying poses including walking, dancing and various types of sports activities demonstrate the feasibility of the proposed approach. © 2006 ieee.

关键词： Imaging systems

来源：评论

学校读者我要写书评

暂无评论

Specular flow and the recovery of surface structure

Specular flow and the recovery of surface structure

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Roth, Stefan Black, Michael J. Department of Computer Science Brown University Providence RI United States

ISBN: (纸本)0769525970

In scenes containing specular objects, the image motion observed by a moving camera may be an intermixed combination of optical flow resulting from diffuse reflectance (diffuse flow) and specular reflection (specular flow). Here, with few assumptions, we formalize the notion of specular flow, show how it relates to the 3D structure of the world, and develop an algorithm for estimating scene structure from 2D image motion. Unlike previous work on isolated specular highlights we use two image frames and estimate the semi-dense flow arising from the specular reflections of textured scenes. We parametrically model the image motion of a quadratic surface patch viewed from a moving camera. The flow is modeled as a probabilistic mixture of diffuse and specular components and the 3D shape is recovered using an Expectation- Maximization algorithm. Rather than treating specular reflections as noise to be removed or ignored, we show that the specular flow provides additional constraints on scene geometry that improve estimation of 3D structure when compared with reconstruction from diffuse flow alone. We demonstrate this for a set of synthetic and real sequences of mixed specular-diffuse objects. © 2006 ieee.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Improved watershed segmentation using water diffusion and local shape priors

Improved watershed segmentation using water diffusion and lo...

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Nguyen, Hieu T. Ji, Qiang Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute United States

ISBN: (纸本)0769525970

The watershed algorithm has many nice properties in terms of robustness to image noise, topology, and effective handling non-rigid deformations. It also has drawbacks including over segmentation and lack of regularization. We present new methods to overcome these drawbacks. We propose a novel region merging algorithm based on the water diffusion principle. Starting with a large number of markers, lakes formed around the markers are merged in the order they meet during the immersion. The merging is not performed immediately but delayed until the amount of water diffusion between two lakes is significant enough to overwhelm the small lake. The delay makes the merging result robust to "leaks" in object boundaries, when weak edges could trigger the merging of object into the background as in traditional methods. Regularization is achieved by imposing priors of local shape configurations. Local shape features are extracted from Gaussian derivatives of the object indicator function. The ensemble of shape features at multiple scales increases representation power. These features are used to incorporate smoothness and domain knowledge into the evolution of region boundaries in the watershed algorithm. The method has been successfully applied to segmentation of worms. © 2006 ieee.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Nonparametric priors on the space of joint intensity distributions for non-rigid multi-modal image registration

Nonparametric priors on the space of joint intensity distrib...

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Cremers, Daniel Guetter, Christoph Xu, Chenyang Department of Computer Science University of Bonn Germany Department of Imaging and Visualization Siemens Corporate Research Princeton NJ

ISBN: (纸本)0769525970

The introduction of prior knowledge has greatly enhanced numerous purely low-level driven image processing algorithms. In this work, we focus on the problem of non-rigid image registration. A number of powerful registration criteria have been developed in the last decade, most prominently the criterion of maximum mutual information. Although this criterion provides for good registration results in many applications, it remains a purely low-level criterion. As a consequence, registration results will deteriorate once this low-level information is corrupted, due to noise, partial occlusions or missing image structure. In this paper, we will develop a Bayesian framework that allows to impose statistically learned prior knowledge about the joint intensity distribution into image registration methods. The prior is given by a kernel density estimate on the space of joint intensity distributions computed from a representative set of pre-registered image pairs. This nonparametric prior accurately models previously learned intensity relations between various image modalities and slice locations. Experimental results demonstrate that the resulting registration process is more robust to missing low-level information as it favors intensity correspondences statistically consistent with the learned intensity distributions. © 2006 ieee.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

Removing outliers using the L∞ norm

Removing outliers using the L∞ norm

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Sim, Kristy Hartley, Richard Australian National University Australian National University National ICT Australia

ISBN: (纸本)0769525970

Recently, there has been interest in solving geometric vision problems such as triangulation and camera resectioning using L∞ minimization. One key advantage of using the L∞ norm rather than the L2 norm is that the L∞ cost function has a single minimum unlike the commonly used L2 cost function which typically has multiple local minima. However, one drawback of using L ∞ minimization is that it is not robust to outliers. By minimizing the L∞ norm instead of the L2 norm, we are, in essence, fitting the outliers and not the good data. Therefore, before one can perform L∞ optimization on a problem, it is first necessary to remove outliers. A popular (but generally unsound) method of removing outliers is to minimize the cost function using standard optimization techniques;then if the residual error is too great, remove the offending measurements and continue. Although this method can fail for simple L 2 optimization problems, we show in this paper that for a wide class of L∞ problems it is a valid technique. It is proved that the set of measurements with greatest residual must contain at least one outlier. Thus, if we keep throwing out the measurements with greatest residual, we will eventually remove all outliers in the data. We test this hypothesis on the multiview reconstruction problem and show that even simple strategies for throwing out these maximum residual measurements are effective in removing outliers. © 2006 ieee.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Feature selection for evaluating fluorescence microscopy images in genome-wide cell screens

Feature selection for evaluating fluorescence microscopy ima...

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Kovalev, Vassili Harder, Nathalie Neumann, Beate Held, Michael Liebel, Urban Erfle, Holger Ellenberg, Jan Eils, Roland Rohr, Karl Dept. Bioinformatics and Functional Genomics IPMB University of Heidelberg Im Neuenheimer Feld 364 69120 Heidelberg Germany Gene Expression and Cell Biology/Biophysics Programmes Meyerhofstrasse 1 69117 Heidelberg Germany Centre for Vision Speech and Signal Processing School of Electronics and Physical Sciences University of Surrey Guildford Surrey GU2 7XH United Kingdom

ISBN: (纸本)0769525970

We investigate different approaches for efficient feature space reduction and compare different methods for cell classification. The application context is the development of automatic methods for analysing fluorescence microscopy images with the goal to identify those genes that are involved in the mitosis of human cells (cell division). We distinguish four cell classes comprising interphase cells, mitotic cells, apoptotic cells, and cells with clustered nuclei. Feature space reduction was performed using the Principal Component Analysis and Independent Component Analysis methods. Six classification methods were examined including unsupervised clustering algorithms such as K-means, Hard Competitive Learning, and Neural Gas as well as Hierarchical Clustering, Support Vector Machines, and Random Forests classifiers. Detailed results on the cell image classification accuracy and computational efficiency achieved using different feature sets and different classification methods are reported. © 2006 ieee.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Euclidean structure from confocal conics: Theory and application to camera calibration

Euclidean structure from confocal conics: Theory and applica...

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Gurdjos, Pierre Kim, Jun-Sik Kweon, In-So IRIT-TCI UPS 118 route de Narbonne 31062 Toulouse Cedex 9 France Dept. of EECS KAIST 373-1 Kusong-Dong Yuseong-Gu Daejeon Korea Republic of

ISBN: (纸本)0769525970

Plane-based calibration is now a very popular procedure because of its flexibility. One key step consists in detecting a set of coplanar features, from which the Euclidean structure of the corresponding 3D plane has to be computed. We suggest to use confocal conics as calibration targets, as they offer undeniable advantages over other ones (e.g., points or lines) in terms of detection and estimation, especially in the presence of partial occlusion. We introduce important projective and Euclidean properties of the linear family of conics (i.e., the confocal conic range), spanned by two confocal conics. In particular, we rely on the fact that the circular point-envelope - a rank-2 conic that encodes the 2D Euclidean structure - is a degenerate member of any confocal conic range. This allows us to give closed-form solutions in three cases: one conic with known foci, two confocal conics with known product of ratios of semi axes, and two unknown confocal conics. The performances of the proposed algorithms (consisting of a few lines of Matlab-like code) show up high accuracies for both intrinsic and extrinsic camera parameters. In addition to experiments with synthetic data, a video sequence is processed, showing off the interest of using confocal conics as calibration targets, for augmented reality purposes. © 2006 ieee.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Control theory and fast marching techniques for brain connectivity mapping

Control theory and fast marching techniques for brain connec...

引用

2006 ieee computer society conference on computer vision and pattern recognition, CVPR 2006

作者： Prados, Emmanuel Lenglet, Christophe Pons, Jean-Philippe Wotawa, Nicolas Deriche, Rachid Faugeras, Olivier Soatto, Stefano UCLA Vision Lab. United States Odyssée Lab. INRIA France

ISBN: (纸本)0769525970

We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magnetic Resonance Imaging (or DTI) and models the white matter by using Riemannian geometry and control theory. We show that it is possible, from a region of interest, to compute the geodesic distance to any other point and the associated optimal vector field. The latter can be used to trace shortest paths coinciding with neural fiber bundles. We also demonstrate that no explicit computation of those 3D curves is necessary to assess the degree of connectivity of the region of interest with the rest of the brain. We finally introduce a general local connectivity measure whose statistics along the optimal paths may be used to evaluate the degree of connectivity of any pair of voxels. All those quantities can be computed simultaneously in a Fast Marching framework, directly yielding the connectivity maps. Apart from being extremely fast, this method has other advantages such as the strict respect of the convoluted geometry of white matter, the fact that it is parameter-free, and its robustness to noise. We illustrate our technique by showing results on real and synthetic datasets. Our GCM (Geodesic Connectivity Mapping) algorithm is implemented in C++ and will be soon available on the web. © 2006 ieee.

关键词： Conformal mapping

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 483 484 485 486 487 488 489 490 491 492 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：