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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

121 篇 会议
9 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

66 篇 工学
- 46 篇 计算机科学与技术...
- 38 篇 软件工程
- 19 篇 信息与通信工程
- 17 篇 机械工程
- 7 篇 控制科学与工程
- 5 篇 电气工程
- 4 篇 光学工程
- 3 篇 化学工程与技术
- 2 篇 电子科学与技术（可...
- 2 篇 生物工程
- 1 篇 航空宇航科学与技...
- 1 篇 核科学与技术
- 1 篇 网络空间安全
37 篇 理学
- 29 篇 数学
- 14 篇 统计学（可授理学、...
- 13 篇 物理学
- 3 篇 化学
- 3 篇 生物学
- 2 篇 系统科学
- 1 篇 地球物理学
17 篇 管理学
- 12 篇 图书情报与档案管...
- 6 篇 管理科学与工程(可...
- 4 篇 工商管理
3 篇 经济学
- 3 篇 应用经济学
3 篇 法学
- 2 篇 社会学
- 1 篇 法学
1 篇 文学
- 1 篇 新闻传播学

主题

27 篇 laboratories
24 篇 multimedia compu...
14 篇 feature extracti...
14 篇 asia
12 篇 robustness
10 篇 algorithm design...
8 篇 clustering algor...
7 篇 face recognition
7 篇 kernel
6 篇 image coding
6 篇 psnr
5 篇 linear discrimin...
5 篇 training data
5 篇 speech recogniti...
5 篇 degradation
5 篇 streaming media
4 篇 learning systems
4 篇 support vector m...
4 篇 computational ef...
4 篇 bandwidth

机构

37 篇 moe-microsoft ke...
23 篇 moe-microsoft ke...
19 篇 microsoft resear...
8 篇 moe-ms key labor...
6 篇 moe-microsoft ke...
6 篇 moe-microsoft ke...
5 篇 department of in...
5 篇 moe-ms key labor...
4 篇 department of in...
4 篇 anhui institute ...
3 篇 moe-ms key labor...
3 篇 anhui province k...
3 篇 dept. of compute...
3 篇 moe microsoft ke...
3 篇 national science...
3 篇 department of el...
3 篇 moe-microsoft ke...
2 篇 moe-microsoft ke...
2 篇 computer science...
2 篇 moe-microsoft ke...

作者

25 篇 nenghai yu
16 篇 yu nenghai
10 篇 liansheng zhuang
9 篇 beiqian dai
9 篇 yanlu xie
6 篇 dong xu
6 篇 shuicheng yan
6 篇 xian-sheng hua
5 篇 hong-jiang zhang
5 篇 weihai li
5 篇 xu dong
5 篇 yan shuicheng
5 篇 wei zhou
4 篇 jun sun
4 篇 minghui liu
4 篇 zhiqiang yao
4 篇 zhuang liansheng
4 篇 li bin
4 篇 bin li
3 篇 xiaoou tang

语言

128 篇 英文
1 篇 其他
1 篇 中文

检索条件"机构=MOE-MS Key Laboratory of Multimedia Computing and Communication"

共 130 条记录，以下是31-40 订阅

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

详细简洁

排序：

Rotation robust detection of copy-move forgery

Rotation robust detection of copy-move forgery

引用

IEEE International Conference on Image Processing

作者： Weihai Li Nenghai Yu MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology Hefei China

Copy-move tampering is a common type of image synthesizing, where a part of an image is copied and pasted to another place to add or remove an object. In this paper, an efficient algorithm based on the Fourier-Mellin Transform is proposed with features extracted along radius direction. Also, to reduce computational cost, a link processing is introduced instead of hash value counting in the counting bloom filters. Moreover, a vector erosion filter is designed to cluster distance vectors, which is usually achieved through vector counters in existed copy-move detection algorithms. Our experimental results show that the improved algorithm can detect duplicated regions efficiently. Especially, the improved algorithm is robust to duplicated regions of large rotation angle, whereas existed algorithms can only treat slight rotation.

关键词： Forgery Robustness Feature extraction Filtering algorithms Clustering algorithms Algorithm design and analysis Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

A robust algorithm for distorted pupil localization based on Ellipse Difference and PSO

A robust algorithm for distorted pupil localization based on...

引用

Congress on Image and Signal Processing, CISP

作者： Hongping Deng Bin Li Zhengyu Su Zhenquan Zhuang MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology Hefei China

Pupil localization is the key step of eye tracking, which directly affecting the precision of eye tracking. Through the process of eye tracking, the shape of pupil is usually distorted, leading to the invalidation of traditional algorithm based on circle localization. Moreover, current algorithms of distorted pupil localization are easily interfered by eyelid and faculae. To solve these problems, this paper raised an operator of Ellipse Difference (ED) to avoid the interference of eyelid and faculae. Meanwhile, to overcome the difficulty of ED operator's high order of complexity, this paper associated the algorithm of Particle Swarm Optimization (PSO) with ED to realize fast pupil localization. The experimental results have demonstrated ED-PSO is more robust than current algorithms and can realize real time processing, which has been applied into real eye tracking system.

关键词： Eyelids Pixel Robustness Interference Particle swarm optimization Signal processing algorithms Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Quantitative and Qualitative Forecasting Applied to Supply-Chain Inventory

Quantitative and Qualitative Forecasting Applied to Supply-C...

引用

International Conference on multimedia and Information Technology, MMIT

作者： Chenxi Shao Lizhong Wang MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology Hefei China Computer Science and Technology School University of Science and Technology China

ISBN: (纸本)9781424466016;9780769540085

In the process of supply chain (SC) management, time inventory management problem is extremely important. In terms of academic methods, quantitative methods are very popular as the researchers could calculate the inventory if they got the historic data of some SC. However, based on quantitative methods and the results cannot too be convincible. This paper considered a supply chain system includes several kinds of products. As to the historic suppliers' demand data of this SC system, firstly we applied a quantitative forecasting analysis method to it; secondly we made a qualitative analysis to improve the complex system's inventory management performance. According to the comparison between quantitative method and the method used in this paper, we find that the accuracy is more perfect. Not only the inventory cost is lower, also the forecasting accuracy is better.

关键词： Supply chains Inventory management Differential equations multimedia computing Laboratories Supply chain management Performance analysis Space technology Information technology Technology forecasting

来源：评论

学校读者我要写书评

暂无评论

N-GRAM NEAREST NEIGHBOR ALGORITHM FOR VOICE PASSWORD SYSTEM

N-GRAM NEAREST NEIGHBOR ALGORITHM FOR VOICE PASSWORD SYSTEM

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Wu Guo Zhao Zhang Yanhua Long Lirong Dai MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China (USTC) China iFly Speech Lab Department of Electronic Engineering and Information Science University of Science and Technology of China (USTC) China

ISBN: (纸本)9781424442959

A specific issue in the voice password system is addressed in this paper: When the text content of target speaker's enrollment password has been already known by imposters, they can do a well-behaved impersonation using the same text content as the target speaker. This results in a much higher false acceptance than the traditional voice password system. N-gram based nearest neighbor algorithm is proposed here to improve the speaker detection accuracy. Furthermore, correlation coefficient is adopted as the distance measurement between two acoustic features instead of the traditional Euclidean distance. Experimental results show that the proposed method outperforms the DTW and GMM-UBM algorithms.

关键词： speaker recognition dynamic time warping nearest neighbor dynamic time warping speaker recognition Nearest neighbor Voice distance measurement Passwords nearest neighbor algorithm Loudspeakers Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

Rights sharing scheme for online DRM system using digital ticket

Rights sharing scheme for online DRM system using digital ti...

引用

International Conference on Management and Service Science, MASS 2009

作者： Yang, Liu Nenghai, Yu Zhuo, Hao MOE-MS Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9781424446391

Rights sharing in DRM system has long been a challenge and a key technical issue. In this paper, a novel rights sharing scheme using digital ticket is proposed. The user who possesses the right object to certain DRM protected content can acquire tickets which act as ownership certifications of the content from right issuer in a controlled manner, and then deliver the tickets to the others. Other user who receives a valid digital ticket can present the ticket to right issuer for specified rights. The proposed scheme introduces little overhead to license server, and is secure against multiple-spending and over-issuing attacks. ©2009 IEEE.

关键词： Licenses Protocols Laboratories multimedia computing Protection Content management Video sharing Business Streaming media Certification

来源：评论

学校读者我要写书评

暂无评论

A peer selection mechanism in P2P networks based on the collaboration of ISPs and P2P systems

A peer selection mechanism in P2P networks based on the coll...

引用

1st International Conference on Information Science and Engineering, ICISE2009

作者： Zhuang, Hong Xu, Yinlong Hu, Yuchong Lin, Xiaobin MOE-MS Key Laboratory of Multimedia Computing and Communication Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9780769538877

This paper studies that how can Internet Service Providers (ISPs) reduce the traffic caused by P2P applications while keeping P2P services. Based on the collaboration of ISPs and P2P, we design an ISP-aided peer selection mechanism, named ISP-AFHA, to reduce the traffic caused by P2P applications. In ISP-AFHA, we introduce Dynamic ISP Hop (DIH) and Backbone Connectivity Cost (BCC) as the main metrics for more specified analysis. DIH based on the Internet Autonomous System (AS) model, is used to measure the network load of ISP routing. BCC bases on the diversity of links in three-tier model of Internet and is used to measure how many backbone networks which a P2P transmission has passed through. The experimental results show that in the environment with heavy P2P traffic, ISP-AFHA can reduce 7.4% of DIH cost and 10.8% of BCC cost in some scenarios, compared with the ISP-aided method in [7]. ©2009 IEEE.

关键词： Internet service providers

来源：评论

学校读者我要写书评

暂无评论

Selective-NRA algorithms for top-k queries

Selective-NRA algorithms for top-k queries

引用

Joint International Conference on Advances in Data and Web Management, APWeb/WAIM 2009

作者： Yuan, Jing Sun, Guang-Zhong Tian, Ye Chen, Guoliang Liu, Zhi MOE-MS Key Laboratory of Multimedia Computing and Communication Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9783642006715

Efficient processing of top-k queries has become a classical research area recently since it has lots of application fields. Fagin et al. proposed the "middleware cost" for a top-k query algorithm. In some databases there is no way to perform a random access, Fagin et al. proposed NRA (No Random Access) algorithm for this case. In this paper, we provided some key observations of NRA. Based on them, we proposed a new algorithm called Selective-NRA (SNRA) which is designed to minimize the useless access of a top-k query. However, we proved the SNRA is not instance optimal in Fagin's notion and we also proposed an instance optimal algorithm Hybrid-SNRA based on algorithm SNRA. We conducted extensive experiments on both synthetic and real-world data. The experiments showed SNRA (Hybrid-SNRA) has less access cost than NRA. For some instances, SNRA performed 50% fewer accesses than NRA. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Subspace construction and selection for speaker recognition

Subspace construction and selection for speaker recognition

引用

7th International Conference on Information, communications and Signal Processing, ICICS 2009

作者： Long, Yanhua Guo, Wu Ma, Bin Chng, Eng Siong Zhu, Donglai Dai, Lirong Li, Haizhou China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication USTC China Singapore Singapore Nanyang Technology University Singapore Singapore

ISBN: (纸本)9781424446575

In this paper, we propose a subspace construction and selection strategy (SUBS) for speaker recognition with limited training and testing speech data. Based on the individual Gaussian distributions of Gaussian mixture model (GMM), each speaker's characteristic subspace is constructed by training an SVM using the corresponding Gaussian mean vectors from the GMms of both enrollment and imposter speakers. A subspace selection based on the structure risk criterion is used to select those subspaces with lower structure risks. The selected subspaces are then combined and used to evaluate the test utterances. We evaluate this subspace strategy on the 10sec-10sec test condition in 2008 NIST Speaker Recognition Evaluations, achieving a relative 12.16% equal error rate reduction over the GMM Supervector baseline system. © 2009 IEEE.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Unsupervised object learning with AM-pLSA

Unsupervised object learning with AM-pLSA

引用

2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009

作者： Zhuang, Liansheng Tang, Ketan Yu, Nenghai Zhou, Wei MOE-MS Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei 230027 China School of Information Science and Technology University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9780769535074

Object recognition based on probabilistic Latent Semantic Analysis (pLSA) has shown excellent performance, but it is sensitive to background clutter. In this paper, we propose a novel framework called AM-pLSA, which combines pLSA with visual attention model, to learn object classes from unlabeled images with cluttered background. We firstly detect salient regions and non-salient regions in an image using visual attention model, assuming that objects to be learned are in salient regions. By this way, we can segment interested objects from images, reducing the influence of background clutter. Then, we model each region as a visual word histogram, and learn objects classes from these regions using pLSA. Experimental results showed that AM-pLSA evidently outperformed pLSA, and was more robust to background clutter. © 2008 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Learning probabilistic structure to group image edges for object extraction

Learning probabilistic structure to group image edges for ob...

引用

2009 IEEE International Conference on multimedia and Expo, ICME 2009

作者： Yangyu, Tao Lin, Liang Yingqing, Xu MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei 230027 China Microsoft Research Asia Beijing 100190 China

ISBN: (纸本)9781424442911

We investigate exploiting the class specific information in the conventional perceptual edge grouping for the task of object extraction, since the domain information is usually available in practice. Instead of applying the classical Gestalt principles, we turn to learn a class specific probabilistic structure model from training images. During the learning, both geometrical and photometric features such as color and texture are fused. Experiments show the model is fairly robust to the intra-class variations of object as well as background clutters. Moreover, we design a novel saliency measure for the grouping based on the probabilistic structure model. The object extraction is formulated as an optimization problem which can be efficiently solved by the recently developed ratio contour algorithm. The effectiveness of the proposed method is demonstrated by the experiments on real images. ©2009 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共13页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：