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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

404 篇 会议
344 篇 期刊文献

馆藏范围

748 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

518 篇 工学
- 347 篇 计算机科学与技术...
- 302 篇 软件工程
- 92 篇 信息与通信工程
- 85 篇 机械工程
- 80 篇 生物工程
- 74 篇 光学工程
- 56 篇 生物医学工程（可授...
- 39 篇 电气工程
- 37 篇 控制科学与工程
- 31 篇 电子科学与技术（可...
- 30 篇 化学工程与技术
- 22 篇 仪器科学与技术
- 22 篇 建筑学
- 17 篇 土木工程
- 11 篇 材料科学与工程（可...
- 9 篇 测绘科学与技术
- 9 篇 交通运输工程
- 8 篇 航空宇航科学与技...
218 篇 理学
- 96 篇 数学
- 81 篇 生物学
- 58 篇 物理学
- 30 篇 化学
- 26 篇 统计学（可授理学、...
112 篇 管理学
- 70 篇 管理科学与工程(可...
- 48 篇 图书情报与档案管...
- 22 篇 工商管理
52 篇 医学
- 46 篇 临床医学
- 36 篇 基础医学(可授医学...
- 32 篇 药学(可授医学、理...
9 篇 经济学
- 9 篇 应用经济学
9 篇 教育学
6 篇 法学
4 篇 农学
4 篇 艺术学

主题

33 篇 virtual reality
30 篇 training
23 篇 semantics
22 篇 visualization
22 篇 feature extracti...
21 篇 solid modeling
19 篇 three-dimensiona...
18 篇 computational mo...
16 篇 object detection
16 篇 deep learning
15 篇 image segmentati...
11 篇 deep neural netw...
11 篇 image color anal...
10 篇 machine learning
10 篇 computer vision
10 篇 image reconstruc...
10 篇 geometry
9 篇 convolution
8 篇 image enhancemen...
8 篇 cameras

机构

192 篇 state key labora...
188 篇 state key labora...
50 篇 zhongguancun lab...
45 篇 school of comput...
40 篇 guangdong provin...
38 篇 peng cheng labor...
24 篇 beijing key labo...
23 篇 the state key la...
22 篇 university of ch...
22 篇 department of co...
18 篇 state key labora...
17 篇 zhengzhou univer...
16 篇 shenzhen key lab...
15 篇 state key labora...
13 篇 department of co...
13 篇 department of co...
12 篇 pengcheng labora...
12 篇 beihang universi...
12 篇 state key labora...
12 篇 school of comput...

作者

46 篇 heng pheng-ann
41 篇 li jia
38 篇 jianwei niu
28 篇 niu jianwei
23 篇 chen xiaowu
22 篇 aimin hao
22 篇 hao aimin
21 篇 hong qin
21 篇 shuai li
18 篇 qin hong
18 篇 wang yunhong
17 篇 tian yonghong
17 篇 xiaowu chen
16 篇 li shuai
15 篇 xuefeng liu
15 篇 zhao yifan
15 篇 lu feng
15 篇 liu xuefeng
15 篇 wang qiong
15 篇 fu chi-wing

语言

650 篇 英文
84 篇 其他
14 篇 中文

检索条件"机构=Key Laboratory of Computer Vision and Virtual Reality Technology"

共 748 条记录，以下是581-590 订阅

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

详细简洁

排序：

CodeRepair: PHY-layer partial packet recovery without the pain

CodeRepair: PHY-layer partial packet recovery without the pa...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Jun Huang Guoliang Xing Jianwei Niu Shan Lin Department of Comptuer Science and Engineering Michigan State University MI USA State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing China Department of Electrical and Computer Engineering Stony Brook University NY USA

Prior studies show that repairing partially corrupted packets, instead of retransmitting them in their entirety, holds potential in improving the performance of 802.11 networks. However, the efficiency of existing packet recovery approaches is severely limited by various overhead associated to redundant transmission and repeated channel contention. In this paper, we propose CodeRepair, a practical coding-based protocol that recovers partially corrupted 802.11 packets without these pains. The design of CodeRepair is based on two novel ideas. First, CodeRepair pushes the limit of 802.11 PHY to piggyback parities in the padded bits of OFDM, obviating the need of transmitting extra information for error correction. Second, CodeRepair corrects errors at the PHY layer, which is significantly more efficient than traditional link-layer approaches. This is due to the fact that a single coded bit usually affects the decoding of a group of data bits in 802.11 convolutional code. As a result, CodeRepair can salvage a partially corrupted packet by correcting a small number of erroneous coded bits using the padded parities. To reduce computational cost of error recovery, CodeRepair employs single parity code for correcting coded bit errors. We propose several techniques to augment the error correcting capability of single parity code without compromising its computation efficiency. Our evaluation shows that CodeRepair recovers an average of 34% partially corrupted packets, and improves the end-to-end link goodput by 59% on lossy 802.11 links.

关键词： IEEE 802.11 Standard Decoding Receivers Reflective binary codes Convolutional codes Forward error correction OFDM

来源：评论

学校读者我要写书评

暂无评论

A high-throughput MQ coder architecture based on dependence extraction method

A high-throughput MQ coder architecture based on dependence ...

引用

作者： Cao, Haiheng Zhang, Yongfei Jiang, Hongxu Beijing Key Laboratory of Digital Media School of Computer Science and Engineering Beihang University Beijing100191 China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing100191 China

ISBN: (纸本)9781479957514

MQ is an efficient entropy coder that performs the actual compression in JPEG2000. However, it usually acts as the bottleneck of the hardware architecture due to the feedback loops caused by iterative operations. The current single ejection (SE) architecture achieves higher frequency by adopting more pipeline stages, but the speed is limited by the throughput per cycle. On the other hand, the multiple ejections (ME) usually handles more than one context data (CxD) per cycle, while the frequency is deteriorated due to the longer critical circuit caused by the context dependences. Hence, to enable the MQ arithmetic coder to process more than one sample while running at higher clock frequency, this paper proposes a two-CxDs architecture based on the equality of two adjacent CxDs, in which the two adjacent CxDs with different contexts are processed in a clock. Experiment results illustrate the architecture increases above 30% speed performance. © 2014 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A person re-identification algorithm based on color topology

A person re-identification algorithm based on color topology

引用

作者： Zeng, Guodong Hu, Hai-Miao Geng, Yanhing Zhang, Chi Beijing Key Laboratory of Digital Media School of Computer Science and Engineering Beihang University Beijing100191 China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing100191 China

ISBN: (纸本)9781479957514

The color feature is one of the main features in person re-identification. Due to the illumination variation and similarity interference, the color feature is not robust. For practical applications, different pedestrian may have similar statistical distribution in terms of color histogram, while the same pedestrian may have different statistical distribution. However, it can be observed that although the color statistical information is not robust, the color spatial distribution can remain stable. According to this observation, this paper proposes a new feature, namely the color topology, to describe the color spatial distribution. One image is segmented into patches and the proposed color topology is represented according to both the gradient and the value of color changes among adjacent patches. Based on the color topology, a person re-identification algorithm is implemented in this paper. The experimental results demonstrate that the proposed algorithm can significantly improve the recognition performance when compared with the state-of-the-art. © 2014 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Robust patch-based tracking using valid patch selection and feature fusion update

Robust patch-based tracking using valid patch selection and ...

引用

作者： Mao, Wenbei Zheng, Jin Li, Bo Beijing Key Laboratory of Digital Media School of Computer Science and Engineering Beihang University Beijing100191 China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing100191 China

ISBN: (纸本)9781479957514

This paper proposes a robust patch-based object tracking algorithm. Unlike many traditional algorithms, which divide the object into multiple patches and allocate the weight values for each patches, this paper uses SIFT feature matching to select valid patches and filter out invalid patches. The invalid patches usually corresponding to the occluded or partially transformed part of the object. Thus, guided by valid patch, patch-based color histogram provides a richer description of the object. The similarity of valid patch is used in particle filter to locate the object. Moreover, since feature similarity is easy to bring into object drift, this paper updates the object template fusing feature similarity and valid patches, which is both scale adaptive and robust to partial occlusion. The experimental results show that the proposed algorithm is more accurate and robust than state-of-the-art tracking algorithms in challenging scenarios. © 2014 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Dissection of hybrid soft tissue models using position-based dynamics 14

Dissection of hybrid soft tissue models using position-based...

引用

20th ACM Symposium on virtual reality Software and technology, VRST 2014

作者： Pan, Junjun Bai, Junxuan Zhao, Xin Hao, Aimin Qin, Hong State Key Laboratory of Virtual Reality Technology and Systems Beihang University China Department of Computer Science Stony Brook University SUNY Stony Brook United States

ISBN: (纸本)9781450332538

This paper describes an interactive dissection approach for hybrid soft tissue models governed by position-based dynamics. Our framework makes use of a hybrid geometric model comprising both surface and volumetric meshes. The fine surface triangular mesh is used to represent the exterior structure of soft tissue models. Meanwhile, the interior structure of soft tissues is constructed by coarser tetrahedral meshes, which are also employed as physical models participating in dynamic simulation. The less details of interior structure can effectively reduce the computational cost of deformation and geometric subdivision during dissection. For physical deformation, we design and implement a position-based dynamics approach that supports topology modification and enforces the volume-preserving constraint. Experimental results have shown that, this hybrid dissection method affords real-time and robust cutting simulation without sacrificing realistic visual performance. Copyright © 2014 by the Association for Computing Machinery, Inc (ACM).

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

引用

20th Anniversary International Conference on MultiMedia Modeling, MMM 2014

作者： Fan, Rui Zhang, Yongfei Li, Zhe Wang, Ning Beijing Key Laboratory of Digital Media School of Computer Science and Engineering Beihang University Beijing 100191 China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing 100191 China

ISBN: (数字)9783319041148

ISBN: (纸本)9783319041131

The emerging High Efficiency Video Coding (HEVC) aims to achieve significantly improved compression performance with respect to the state-of-the-art H.264/AVC high profile. This better compression performance is achieved at a much higher computational complexity, which makes it difficult for real-time video systems. To reduce the encoding complexity, this paper presents an improved similarity-based fast coding unit depth decision algorithm for inter-frame coding. Firstly, a fast and precise depth information acquisition method is proposed to improve the accuracy of depth prediction. Secondly, CTUs of the medium similarity degree is further divided into two similarity degree categories, and the complexity of coding the coding tree units of these two categories is reduced by different coding unit depth decision strategies. Experimental results show that proposed algorithm can save on average 35.72% of the encoding time with negligible loss on the rate-distortion performance compared with HM11.0 and consistently outperforms the state-of-the-art schemes. © 2014 Springer International Publishing.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

A compression sensing sampling scheme based on the golden section principle

A compression sensing sampling scheme based on the golden se...

引用

International Conference on Machine Tool technology and Mechatronics Engineering, ICMTTME 2014

作者： Li, Xiao-Ning Wu, Zhang-Hong Xing, Hao-Yang School of Computer Science Sichuan Normal University Chengdu China Visual Computing and Virtual Reality Key Laboratory of Sichuan Province Chengdu China School of Physic Science and Technology Sichuan University Chengdu China

ISBN: (纸本)9783038352464

In classic radial sampling scheme, angle intervals between adjacent straight sampling lines are the same. And so the coherence between the sampling matrix and the sparse matrix is high. Many pseudo-shadows will occur on the reconstructed image. For this problem, we put forward a novel sampling scheme in which the scan lines are placed in the manner of golden section angle interval. In the resulting sampling matrix, the scan lines scatter randomly on the whole. Experimental results demonstrate that the algorithm proposed in this paper has lower correlation coefficient between sampling matrix and sparse matrix than classic radial sampling scheme and random radial sampling scheme. Image can be accurately reconstructed by collecting less data than the other two schemes. © (2014) Trans Tech Publications, Switzerland.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Maximizing investment income of SSP for spectrum trading in cognitive radio networks

Maximizing investment income of SSP for spectrum trading in ...

引用

IEEE Conference on Wireless Communications and Networking

作者： Lu Wang Zhong Zhou Wei Wu State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science of Beihang University Beijing China

ISBN: (纸本)9781479930845

More and more researches have demonstrated the benefits of cognitive radio technology in improving flexibility and efficiency of spectrum utilization. In order to encourage primary users (PUs) to share their idle spectrum resources with secondary users (SUs), spectrum trading frameworks are developed. In this paper, the investment problem of spectrum service provider (SSP) is considered which obtains spectrum from PUs and provides service to multiple SUs. The SUs' actions are estimated according to statistical data. A estimation method for channels number is proposed basing on maximizing the SSP's investment income. A Markov chain model is used to analyze the SSP's state transition and calculate the SU's waiting time and queuing size by queuing theory. The optimal number of channels is deduced with marginal analysis theory. In either spectrum purchase or auction, the SSP could adjust its investment strategy timely and flexibly according to these parameters.

关键词： Investment Estimation Bandwidth Markov processes Analytical models Queueing analysis

来源：评论

学校读者我要写书评

暂无评论

k-hop Centrality Metric for Identifying Influential Spreaders in Dynamic Large-scale Social Networks

k-hop Centrality Metric for Identifying Influential Spreader...

引用

IEEE Global Communications Conference

作者： Jianwei Niu Jinyang Fan Lei Wang Milica Stojmenovic State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University FICT Swinburne University of Technology

ISBN: (纸本)9781479935130

Identifying the most influential spreaders in social networks has many practical applications. The existing methods for the purpose are either too time-consuming for dynamic large-scale networks, such as betweenness centrality, closeness centrality, eigenvector centrality and Katz centrality, or do not consider the network topology, such as degree centrality. To design an effective method to identify the most influential nodes in a network, we propose a novel metric, k-hop centrality which is a generalization of degree centrality. The k-hop index is the summation of the number n(i) of nodes within i-hop distance from the node in question, attenuated by 1/α~i, for 1 ≤ i ≤ k (α is the average degree of nodes in the network). It is calculated in a localized manner and is complexity-scalable by adjusting the value of k, thus suitable for dynamically changing, large social networks. We adopt the Susceptible Infected Recovered (SIR) model to evaluate the performance of k-hop centrality over four real datasets of complex networks, and experimental results show that our method outperforms state-of-the-art methods in this field in terms of both infection ratios (spreading influence) and computational complexity. Our work sheds some light on designing efficient spreading strategies for complex networks.

关键词： Centrality measure Influential node Information dissemination SIR model Complex network

来源：评论

学校读者我要写书评

暂无评论

Learning Label Set Relevance for Search Based Image Annotation

Learning Label Set Relevance for Search Based Image Annotati...

引用

International Conference on virtual reality and Visualization (ICVRV)

作者： Feng Tian Xukun Shen School of Computer and Information Technology Northeast Petroleum University Daqing Heilongjiang China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing China

As a way to facilitate image categorization and retrieval, automatic image annotation has received much research attention. Traditional web image annotation methods often estimate the label relevance to image by the most common labels' frequency derived from its nearest neighbors, and neglect the relevance of the assigned label set as a whole. We propose in this paper a novel search based image annotation method by learning label set relevance, which aims at annotating large scale image collections in real environment. "Label set"-to-image relevance and label set correlation are formulated into a joint framework. Measures that can estimate the label set relevance are designed. The assigned label set provide a more precise description of the image's content. To reduce the complexity, a heuristic algorithm is introduced to annotate image accurately and efficiently in large scale web image set. Experiments on real world web dataset demonstrate the general applicability of our algorithm in web image annotation. In comparison to state-of-the-art, the proposed method achieves excellent performance.

关键词： Correlation Semantics Visualization Vocabulary Complexity theory Sun Rain

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 55 56 57 58 59 60 61 62 63 64 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：