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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

22,998 篇 会议
93 篇 期刊文献
4 册 图书

馆藏范围

23,094 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

13,621 篇 工学
- 11,107 篇 计算机科学与技术...
- 3,478 篇 软件工程
- 2,445 篇 机械工程
- 1,715 篇 光学工程
- 1,076 篇 电气工程
- 1,013 篇 控制科学与工程
- 784 篇 信息与通信工程
- 411 篇 仪器科学与技术
- 352 篇 生物工程
- 251 篇 生物医学工程（可授...
- 196 篇 电子科学与技术（可...
- 114 篇 化学工程与技术
- 107 篇 安全科学与工程
- 100 篇 测绘科学与技术
- 88 篇 建筑学
- 85 篇 交通运输工程
- 84 篇 土木工程
3,494 篇 医学
- 3,481 篇 临床医学
- 81 篇 基础医学(可授医学...
3,240 篇 理学
- 1,939 篇 物理学
- 1,639 篇 数学
- 563 篇 统计学（可授理学、...
- 500 篇 生物学
- 249 篇 系统科学
- 106 篇 化学
521 篇 管理学
- 311 篇 图书情报与档案管...
- 223 篇 管理科学与工程(可...
- 76 篇 工商管理
276 篇 艺术学
- 276 篇 设计学（可授艺术学...
66 篇 法学
- 63 篇 社会学
38 篇 农学
28 篇 教育学
22 篇 经济学
10 篇 军事学
3 篇 文学

主题

10,186 篇 computer vision
3,919 篇 pattern recognit...
3,005 篇 training
2,007 篇 computational mo...
1,817 篇 visualization
1,815 篇 cameras
1,515 篇 feature extracti...
1,481 篇 shape
1,455 篇 three-dimensiona...
1,438 篇 image segmentati...
1,287 篇 robustness
1,205 篇 computer archite...
1,155 篇 semantics
1,147 篇 conferences
1,107 篇 layout
1,093 篇 computer science
1,088 篇 object detection
1,025 篇 benchmark testin...
970 篇 codes
923 篇 face recognition

机构

136 篇 univ sci & techn...
121 篇 univ chinese aca...
118 篇 chinese univ hon...
109 篇 carnegie mellon ...
101 篇 tsinghua univers...
100 篇 microsoft resear...
95 篇 swiss fed inst t...
93 篇 zhejiang univ pe...
82 篇 university of sc...
81 篇 zhejiang univers...
81 篇 university of ch...
77 篇 shanghai ai lab ...
72 篇 shanghai jiao to...
69 篇 national laborat...
68 篇 microsoft res as...
67 篇 alibaba grp peop...
64 篇 adobe research
64 篇 tsinghua univ pe...
60 篇 peking univ peop...
59 篇 univ oxford oxfo...

作者

81 篇 van gool luc
72 篇 timofte radu
64 篇 zhang lei
47 篇 luc van gool
40 篇 yang yi
40 篇 li stan z.
37 篇 loy chen change
34 篇 chen chen
33 篇 qi tian
32 篇 liu yang
32 篇 xiaoou tang
32 篇 sun jian
31 篇 tian qi
30 篇 murino vittorio
30 篇 pascal fua
29 篇 darrell trevor
29 篇 li fei-fei
28 篇 li xin
28 篇 ying shan
27 篇 vasconcelos nuno

语言

23,028 篇 英文
38 篇 其他
22 篇 中文
5 篇 土耳其文
2 篇 日文

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

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

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

详细简洁

排序：

Fast and Accurate Model Scaling

Fast and Accurate Model Scaling

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Dollar, Piotr Singh, Mannat Girshick, Ross Facebook AI Res FAIR Menlo Pk CA 94025 USA

ISBN: (纸本)9781665445092

In this work we analyze strategies for convolutional neural network scaling;that is, the process of scaling a base convolutional network to endow it with greater computational complexity and consequently representational power. Example scaling strategies may include increasing model width, depth, resolution, etc. While various scaling strategies exist, their tradeoffs are not fully understood. Existing analysis typically focuses on the interplay of accuracy and flops (floating point operations). Yet, as we demonstrate, various scaling strategies affect model parameters, activations, and consequently actual runtime quite differently. In our experiments we show the surprising result that numerous scaling strategies yield networks with similar accuracy but with widely varying properties. This leads us to propose a simple fast compound scaling strategy that encourages primarily scaling model width, while scaling depth and resolution to a lesser extent. Unlike currently popular scaling strategies, which result in about O(s) increase in model activation w.r.t. scaling flops by a factor of s, the proposed fast compound scaling results in close to O(root s) increase in activations, while achieving excellent accuracy. Fewer activations leads to speedups on modern memory-bandwidth limited hardware (e.g., GPUs). More generally, we hope this work provides a framework for analyzing scaling strategies under various computational constraints.

关键词： computer vision Runtime Computational modeling Hardware pattern recognition Compounds Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentation

Temporally-Weighted Hierarchical Clustering for Unsupervised...

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Sarfraz, M. Saquib Murray, Naila Sharma, Vivek Diba, Ali van Gool, Luc Stiefelhagen, Rainer Karlsruhe Inst Technol Karlsruhe Germany Facebook AI Res Menlo Pk CA USA MIT Cambridge MA 02139 USA Harvard Med Sch Boston MA 02115 USA Katholieke Univ Leuven Leuven Belgium Swiss Fed Inst Technol Zurich Switzerland Daimler TSS Ulm Germany

ISBN: (纸本)9781665445092

Action segmentation refers to inferring boundaries of semantically consistent visual concepts in videos and is an important requirement for many video understanding tasks. For this and other video understanding tasks, supervised approaches have achieved encouraging performance but require a high volume of detailed frame-level annotations. We present a fully automatic and unsupervised approach for segmenting actions in a video that does not require any training. Our proposal is an effective temporally-weighted hierarchical clustering algorithm that can group semantically consistent frames of the video. Our main finding is that representing a video with a 1-nearest neighbor graph by taking into account the time progression is sufficient to form semantically and temporally consistent clusters of frames where each cluster may represent some action in the video. Additionally, we establish strong unsupervised baselines for action segmentation and show significant performance improvements over published unsupervised methods on five challenging action segmentation datasets. Our code is available.

关键词： Training Measurement Visualization computer vision Codes Spatiotemporal phenomena pattern recognition

来源：评论

学校读者我要写书评

暂无评论

NBNet: Noise Basis Learning for Image Denoising with Subspace Projection

NBNet: Noise Basis Learning for Image Denoising with Subspac...

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Cheng, Shen Wang, Yuzhi Huang, Haibin Liu, Donghao Fan, Haoqiang Liu, Shuaicheng Megvii Technol Beijing Peoples R China Kuaishou Technol Beijing Peoples R China Univ Elect Sci & Technol China Chengdu Peoples R China

ISBN: (纸本)9781665445092

In this paper, we introduce NBNet, a novel framework for image denoising. Unlike previous works, we propose to tackle this challenging problem from a new perspective: noise reduction by image-adaptive projection. Specifically, we propose to train a network that can separate signal and noise by learning a set of reconstruction basis in the feature space. Subsequently, image denosing can be achieved by selecting corresponding basis of the signal subspace and projecting the input into such space. Our key insight is that projection can naturally maintain the local structure of input signal, especially for areas with low light or weak textures. Towards this end, we propose SSA, a non-local attention module we design to explicitly learn the basis generation as well as subspace projection. We further incorporate SSA with NBNet, a UNet structured network designed for end-to-end image denosing based. We conduct evaluations on benchmarks, including SIDD and DND, and NBNet achieves state-of-the-art performance on PSNR and SSIM with significantly less computational cost.

关键词： computer vision Convolution Computational modeling Noise reduction Network architecture pattern recognition Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Learning To Count Everything

Learning To Count Everything

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Ranjan, Viresh Sharma, Udbhav Thu Nguyen Hoai, Minh SUNY Stony Brook Stony Brook NY 11794 USA VinAI Res Hanoi Vietnam

ISBN: (纸本)9781665445092

Existing works on visual counting primarily focus on one specific category at a time, such as people, animals, and cells. In this paper, we are interested in counting everything, that is to count objects from any category given only a few annotated instances from that category. To this end, we pose counting as a few-shot regression task. To tackle this task, we present a novel method that takes a query image together with a few exemplar objects from the query image and predicts a density map for the presence of all objects of interest in the query image. We also present a novel adaptation strategy to adapt our network to any novel visual category at test time, using only a few exemplar objects from the novel category. We also introduce a dataset of 147 object categories containing over 6000 images that are suitable for the few-shot counting task. The images are annotated with two types of annotation, dots and bounding boxes, and they can be used for developing few-shot counting models. Experiments on this dataset shows that our method outperforms several state-of-the-art object detectors and few-shot counting approaches. Our code and dataset can be found at https://***/cvlab-stonybrook/LearningToCountEverything.

关键词： Visualization computer vision Codes Annotations Animals Detectors pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Learning Progressive Point Embeddings for 3D Point Cloud Generation

Learning Progressive Point Embeddings for 3D Point Cloud Gen...

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Wen, Cheng Yu, Baosheng Tao, Dacheng Univ Sydney Fac Engn Sch Comp Sci 6 Cleveland St Darlington NSW 2008 Australia

ISBN: (纸本)9781665445092

Generative models for 3D point clouds are extremely important for scene/object reconstruction applications in autonomous driving and robotics. Despite recent success of deep learning-based representation learning, it remains a great challenge for deep neural networks to synthesize or reconstruct high-fidelity point clouds, because of the difficulties in 1) learning effective pointwise representations;and 2) generating realistic point clouds from complex distributions. In this paper, we devise a dual-generators framework for point cloud generation, which generalizes vanilla generative adversarial learning framework in a progressive manner. Specifically, the first generator aims to learn effective point embeddings in a breadth-first manner, while the second generator is used to refine the generated point cloud based on a depth-first point embedding to generate a robust and uniform point cloud. The proposed dual-generators framework thus is able to progressively learn effective point embeddings for accurate point cloud generation. Experimental results on a variety of object categories from the most popular point cloud generation dataset, ShapeNet, demonstrate the state-of-the-art performance of the proposed method for accurate point cloud generation.

关键词： Deep learning Solid modeling computer vision Three-dimensional displays Generators Adversarial machine learning pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Sparse Multi-Path Corrections in Fringe Projection Profilometry

Sparse Multi-Path Corrections in Fringe Projection Profilome...

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Zhang, Yu Lau, Daniel Wipf, David Nanjing Univ Nanjing Peoples R China Univ Kentucky Lexington KY 40506 USA Amazon Seattle WA USA

ISBN: (纸本)9781665445092

Three-dimensional scanning by means of structured light illumination is an active imaging technique involving projecting and capturing a series of striped patterns and then using the observed warping of stripes to reconstruct the target object's surface through triangulating each pixel in the camera to a unique projector coordinate corresponding to a particular feature in the projected patterns. The undesirable phenomenon of multi-path occurs when a camera pixel simultaneously sees features from multiple projector coordinates. Bimodal multi-path is a particularly common situation found along step edges, where the camera pixel sees both a foreground and background surface. Generalized from bimodal multi-path, this paper examines the phenomenon of sparse or N-modal multi-path as a more general case, where the camera pixel sees no fewer than two reflective surfaces, resulting in decoding errors. Using fringe projection profilometry, our proposed solution is to treat each camera pixel as an underdetermined linear system of equations and to find the sparsest (least number of paths) solution by taking an application-specific Bayesian learning approach. We validate this algorithm with both simulations and a number of challenging real-world scenarios, demonstrating that it outperforms state-of-the-art techniques.

关键词： Linear systems Surface reconstruction computer vision Lighting Cameras Mathematical models pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Double low-rank representation with projection distance penalty for clustering

Double low-rank representation with projection distance pena...

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Fu, Zhiqiang Zhao, Yao Chang, Dongxia Zhang, Xingxing Wang, Yiming Beijing Jiaotong Univ Inst Informat Sci Beijing Peoples R China Beijing Key Lab Adv Informat Sci & Network Techno Beijing Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China

ISBN: (纸本)9781665445092

This paper presents a novel, simple yet robust self-representation method, i.e., Double Low-Rank Representation with Projection Distance penalty (DLRRPD) for clustering. With the learned optimal projected representations, DLRRPD is capable of obtaining an effective similarity graph to capture the multi-subspace structure. Besides the global low-rank constraint, the local geometrical structure is additionally exploited via a projection distance penalty in our DLRRPD, thus facilitating a more favorable graph. Moreover, to improve the robustness of DLRRPD to noises, we introduce a Laplacian rank constraint, which can further encourage the learned graph to be more discriminative for clustering tasks. Meanwhile, Frobenius norm (instead of the popularly used nuclear norm) is employed to enforce the graph to be more block-diagonal with lower complexity. Extensive experiments have been conducted on synthetic, real, and noisy data to show that the proposed method outperforms currently available alternatives by a margin of 1.0%similar to 10.1%.

关键词： computer vision Laplace equations Robustness pattern recognition Complexity theory Noise measurement Task analysis

来源：评论

学校读者我要写书评

暂无评论

Enhance Curvature Information by Structured Stochastic Quasi-Newton Methods

Enhance Curvature Information by Structured Stochastic Quasi...

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Yang, Minghan Xu, Dong Chen, Hongyu Wen, Zaiwen Chen, Mengyun Peking Univ Sch Math Sci Beijing Peoples R China Peking Univ Beijing Int Ctr Math Res Beijing Peoples R China Peking Univ Ctr Data Sci Beijing Peoples R China Peking Univ Natl Engn Lab Big Data Anal & Applicat Beijing Peoples R China Huawei Technol Co Ltd Shenzhen Peoples R China

ISBN: (纸本)9781665445092

In this paper, we consider stochastic second-order methods for minimizing a finite summation of nonconvex functions. One important key is to find an ingenious but cheap scheme to incorporate local curvature information. Since the true Hessian matrix is often a combination of a cheap part and an expensive part, we propose a structured stochastic quasi-Newton method by using partial Hessian information as much as possible. By further exploiting either the low-rank structure or the kronecker-product properties of the quasi-Newton approximations, the computation of the quasi-Newton direction is affordable. Global convergence to stationary point and local superlinear convergence rate are established under some mild assumptions. Numerical results on logistic regression, deep autoencoder networks and deep convolutional neural networks show that our proposed method is quite competitive to the state-of-the-art methods.

关键词： Training computer vision pattern recognition Convolutional neural networks Artificial intelligence Portfolios Optimization

来源：评论

学校读者我要写书评

暂无评论

StyleSpace Analysis: Disentangled Controls for StyleGAN Image Generation

StyleSpace Analysis: Disentangled Controls for StyleGAN Imag...

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Wu, Zongze Lischinski, Dani Shechtman, Eli Hebrew Univ Jerusalem Jerusalem Israel Adobe Res San Jose CA USA

ISBN: (纸本)9781665445092

We explore and analyze the latent style space of StyleGAN2, a state-of-the-art architecture for image generation, using models pretrained on several different datasets. We first show that StyleSpace, the space of channel-wise style parameters, is significantly more disentangled than the other intermediate latent spaces explored by previous works. Next, we describe a method for discovering a large collection of style channels, each of which is shown to control a distinct visual attribute in a highly localized and disentangled manner. Third, we propose a simple method for identifying style channels that control a specific attribute, using a pretrained classifier or a small number of example images. Manipulation of visual attributes via these StyleSpace controls is shown to be better disentangled than via those proposed in previous works. To show this, we make use of a newly proposed Attribute Dependency metric. Finally, we demonstrate the applicability of StyleSpace controls to the manipulation of real images. Our findings pave the way to semantically meaningful and well-disentangled image manipulations via simple and intuitive interfaces.

关键词： Measurement Visualization computer vision Analytical models Image synthesis computer architecture Aerospace electronics

来源：评论

学校读者我要写书评

暂无评论

Stochastic Whitening Batch Normalization

Stochastic Whitening Batch Normalization

引用

ieee/CVF conference on computer vision and pattern recognition (CVPR)

作者： Zhang, Shengdong Nezhadarya, Ehsan Fashandi, Homa Liu, Jiayi Graham, Darin Shah, Mohak LG Elect Canada Toronto AI Lab Toronto ON Canada LG Elect USA Amer R&D Lab Santa Clara CA USA

ISBN: (纸本)9781665445092

Batch Normalization (BN) is a popular technique for training Deep Neural Networks (DNNs). BN uses scaling and shifting to normalize activations of mini-batches to accelerate convergence and improve generalization. The recently proposed Iterative Normalization (IterNorm) method improves these properties by whitening the activations iteratively using Newton's method. However, since Newton's method initializes the whitening matrix independently at each training step, no information is shared between consecutive steps. In this work, instead of exact computation of whitening matrix at each time step, we estimate it gradually during training in an online fashion, using our proposed Stochastic Whitening Batch Normalization (SWBN) algorithm. We show that while SWBN improves the convergence rate and generalization of DNNs, its computational overhead is less than that of IterNorm. Due to the high efficiency of the proposed method, it can be easily employed in most DNN architectures with a large number of layers. We provide comprehensive experiments and comparisons between BN, IterNorm, and SWBN layers to demonstrate the effectiveness of the proposed technique in conventional (many-shot) image classification and few-shot classification tasks.

关键词： Training Deep learning computer vision Stochastic processes pattern recognition Iterative methods Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：