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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Concurrent subspaces analysis

Concurrent subspaces analysis

引用

2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005

作者： Xu, Dong Yan, Shuicheng Zhang, Lei Zhang, Hong-Jiang Liu, Zhengkai Shum, Heung-Yeung MOE-Microsoft Key Laboratory of Multimedia Computing and Communication Department of EEIS University of Science and Technology of China Hefei Anhui China Department of Information Engineering Chinese University of Hong Kong Shatin Hong Kong Microsoft Research Asia Beijing China

ISBN: (纸本)0769523722

A representative subspace is significant for image analysis, while the corresponding techniques often suffer from the curse of dimensionality dilemma. In this paper, we propose a new algorithm, called Concurrent Subspaces Analysis (CSA), to derive representative subspaces by encoding image objects as 2 nd or even higher order tensors. In CSA, an original higher dimensional tensor is transformed into a lower dimensional one using multiple concurrent subspaces that characterize the most representative information of different dimensions, respectively. Moreover, an efficient procedure is provided to learn these subspaces in an iterative manner. As analyzed in this paper, each sub-step of CSA takes the column vectors of the matrices, which are acquired from the k-mode unfolding of the tensors, as the new objects to be analyzed, thus the curse of dimensionality dilemma can be effectively avoided. The extensive experiments on the 3rd order tensor data, simulated video sequences and Gabor filtered digital number image database show that CSA outper-forms Principal Component Analysis in terms of both reconstruction and classification capability. © 2005 IEEE.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

Fisher+Kernel Criterion for discriminant analysis

Fisher+Kernel Criterion for discriminant analysis

引用

2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005

作者： Yang, Shu Yan, Shuicheng Xu, Dong Tang, Xiaoou Zhang, Chao National Laboratory on Machine Perception Peking University Beijing China Department of Information Engineering Chinese University of Hong Kong Shatin Hong Kong MOE-Microsoft Key Laboratory of Multimedia Computing and Communication Department of EEIS University of Science and Technology of China Hefei Anhui China Microsoft Research Asia Beijing China

ISBN: (纸本)769523722

We simultaneously approach two tasks of nonlinear discriminant analysis and kernel selection problem by proposing a unified criterion, Fisher+Kernel Criterion. In addition, an efficient procedure is derived to optimize this new criterion in an iterative manner. More specifically, original input vector is first transformed into a higher dimensional feature matrix through a battery of nonlinear mappings involved in different kernels. Then, based on the feature matrices, FKC is presented within two coupled projection spaces: one projection space is used to search for the optimal combinations of kernels; while the other encodes the optimal nonlinear discriminating projection directions. Our proposed method is a unified framework for both kernel selection and nonlinear discriminant analysis. Besides, the algorithm potentially alleviates overfitting problem existing in traditional KDA and has no singularity problems in most cases. The effectiveness of our proposed algorithm is validated by extensive face recognition experiments on several datasets. © 2005 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Automated segmentation and tracking of cells in time-lapse microscopy using watershed and mean shift

Automated segmentation and tracking of cells in time-lapse m...

引用

IEEE International Symposium on Intelligent Signal Processing and communication Systems (ISPACS)

作者： Xiaodong Yang Houqiang Li Xiaobo Zhou S. Wong MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology China Harvard Center for Neurodegeneration and Repair-Center for Bioinformatics Harvard Medical School USA

In this paper, we present a new method combining watershed and mean shift for segmentation and tracking of cancer cell nuclei in time-lapse fluorescence. First, we apply the watershed algorithm to segment the cells in each frame of the video sequence, including clustered cells. Second, mean shift method is employed to track each cell in its cycle progression. The proposed method can automatically segment and track all cells without any manual initialization. Experimental result shows that our method can detect almost all the touching cells and track them successfully, especially in the case of cell mitosis which is a difficult task using traditional methods such as snake and level set.

关键词： Microscopy Fluorescence Image segmentation Cancer Level set Drugs Robustness Surface topography Laboratories multimedia computing

来源：评论

学校读者我要写书评

暂无评论

Discriminant analysis with tensor representation

Discriminant analysis with tensor representation

引用

2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005

作者： Yan, Shuicheng Xu, Dong Yang, Qiang Zhang, Lei Tang, Xiaoou Zhang, Hong-Jiang Department of Information Engineering Chinese University of Hong Kong Shatin Hong Kong MOE-Microsoft Key Laboratory of Multimedia Computing and Communication Department of EEIS University of Science and Technology of China Hefei Anhui China Department of Computer Science Hong Kong University of Science and Technology Hong Kong Hong Kong Microsoft Research Asia Beijing China

ISBN: (纸本)0769523722

In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First, we propose a Discriminant Tensor Criterion (DTC), whereby multiple interrelated lower-dimensional discriminative subspaces are derived for feature selection. Then, a novel approach called k-mode Cluster-based Discriminant Analysis is presented to iteratively learn these subspaces by unfolding the tensor along different tensor dimensions. We call this algorithm Discriminant Analysis with Tensor Representation (DATER), which has the following characteristics: 1) multiple interrelated subspaces can collaborate to discriminate different classes;2) for classification problems involving higher-order tensors, the DATER algorithm can avoid the curse of dimensionality dilemma and overcome the small sample size problem;and 3) the computational cost in the learning stage is reduced to a large extent owing to the reduced data dimensions in generalized eigenvalue decomposition. We provide extensive experiments by encoding face images as 2nd or 3rd order tensors to demonstrate that the proposed DATER algorithm based on higher order tensors has the potential to outperform the traditional subspace learning algorithms, especially in the small sample size cases. © 2005 IEEE.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Graph embedding: a general framework for dimensionality reduction

Graph embedding: a general framework for dimensionality redu...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Shuicheng Yan Dong Xu Benyu Zhang Hong-Jiang Zhang Department of Information Engineering Chinese University of Hong Kong Sha Tin Hong Kong China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication & Department of EEIS University of Science and Technology Hefei Anhui China Microsoft Research Asia Beijing China

ISBN: (纸本)0769523722

In the last decades, a large family of algorithms - supervised or unsupervised; stemming from statistic or geometry theory - have been proposed to provide different solutions to the problem of dimensionality reduction. In this paper, beyond the different motivations of these algorithms, we propose a general framework, graph embedding along with its linearization and kernelization, which in theory reveals the underlying objective shared by most previous algorithms. It presents a unified perspective to understand these algorithms; that is, each algorithm can be considered as the direct graph embedding or its linear/kernel extension of some specific graph characterizing certain statistic or geometry property of a data set. Furthermore, this framework is a general platform to develop new algorithm for dimensionality reduction. To this end, we propose a new supervised algorithm, Marginal Fisher Analysis (MFA), for dimensionality reduction by designing two graphs that characterize the intra-class compactness and inter-class separability, respectively. MFA measures the intra-class compactness with the distance between each data point and its neighboring points of the same class, and measures the inter-class separability with the class margins; thus it overcomes the limitations of traditional Linear Discriminant Analysis algorithm in terms of data distribution assumptions and available projection directions. The toy problem on artificial data and the real face recognition experiments both show the superiority of our proposed MFA in comparison to LDA.

关键词： Linear discriminant analysis Statistics Geometry Kernel Algorithm design and analysis Principal component analysis Laplace equations Asia Vectors Laboratories

来源：评论

学校读者我要写书评

暂无评论

An Approach for the Implementation of Personalization Recommendation of Text Information Retrieval With TextCC

An Approach for the Implementation of Personalization Recomm...

引用

2005 International Conference on Neural Networks and Brain(ICNN&B’05)

作者： Zhenya Zhang Shuguang Zhang Xufa Wang Shuangping Chen Hongmei Cheng MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China(USTC) Electronical Engineering & Information Science Department of USTC Statistics&Finance Department of USTC Computer Science Department of USTC Mathematics Department of Anhui Normal University

To implement personalization recommendation of text information retrieval(TR) based in user-focus,TextCC,a feed forward neural network for instantly classification is adopted to classify query results according to user-focuses of a user in the *** results show that the implementation of personalization recommendation with TextCC can lighten the user's burden induced by the work of filtering valid information from vast information in some degree while the time requirement of TR is satisfied very well.

关键词： Web An Approach for the Implementation of Personalization Recommendation of Text Information Retrieval With TextCC

来源：评论

学校读者我要写书评

暂无评论

Concurrent subspaces analysis

Concurrent subspaces analysis

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Dong Xu Shuicheng Yan Lei Zhang Hong-Jiang Zhang Zhengkai Liu Heung-Yeung Shum MOE-Microsoft Key Laboratory of Multimedia Computing and Communication & Department of EEIS University of Science and Technology Hefei Anhui China Department of Information Engineering Chinese University of Hong Kong Sha Tin Hong Kong China Microsoft Research Asia Beijing China

ISBN: (纸本)0769523722

A representative subspace is significant for image analysis, while the corresponding techniques often suffer from the curse of dimensionality dilemma. In this paper, we propose a new algorithm, called concurrent subspaces analysis (CSA), to derive representative subspaces by encoding image objects as 2/sup nd/ or even higher order tensors. In CSA, an original higher dimensional tensor is transformed into a lower dimensional one using multiple concurrent subspaces that characterize the most representative information of different dimensions, respectively. Moreover, an efficient procedure is provided to learn these subspaces in an iterative manner. As analyzed in this paper, each sub-step of CSA takes the column vectors of the matrices, which are acquired from the k-mode unfolding of the tensors, as the new objects to be analyzed, thus the curse of dimensionality dilemma can be effectively avoided. The extensive experiments on the 3/sup rd/ order tensor data, simulated video sequences and Gabor filtered digital number image database show that CSA outperforms principal component analysis in terms of both reconstruction and classification capability.

关键词： Tensile stress Image sequence analysis Image analysis Algorithm design and analysis Image coding Analytical models Video sequences Digital filters Gabor filters Image databases

来源：评论

学校读者我要写书评

暂无评论

Coupled kernel-based subspace learning

Coupled kernel-based subspace learning

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Shuicheng Yan Dong Xu Lei Zhang Benyu Zhang HongJiang Zhang Department of Information Engineering Chinese University of Hong Kong Sha Tin Hong Kong China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication & Department of EEIS University of Science and Technology Hefei Anhui China Microsoft Research Asia Beijing China

ISBN: (纸本)0769523722

It was prescriptive that an image matrix was transformed into a vector before the kernel-based subspace learning. In this paper, we take the kernel discriminant analysis (KDA) algorithm as an example to perform kernel analysis on 2D image matrices directly. First, each image matrix is decomposed as the product of two orthogonal matrices and a diagonal one by using singular value decomposition; then an image matrix is expanded to be of higher or even infinite dimensions by applying the kernel trick on the column vectors of the two orthogonal matrices; finally, two coupled discriminative kernel subspaces are iteratively learned for dimensionality reduction by optimizing the Fisher criterion measured by Frobenius norm. The derived algorithm, called coupled kernel discriminant analysis (CKDA), effectively utilizes the underlying spatial structure of objects and the discriminating information is encoded in two coupled kernel subspaces respectively. The experiments on real face databases compared with KDA and Fisherface validate the effectiveness of CKDA.

关键词： Kernel Matrix decomposition Algorithm design and analysis Principal component analysis Feature extraction Linear discriminant analysis Image analysis Performance analysis Asia Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Fisher+Kernel criterion for discriminant analysis

Fisher+Kernel criterion for discriminant analysis

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Shu Yang Shuicheng Yan Dong Xu Xiaoou Tang Chao Zhang National Laboratory on Machine Perception First Hospital Peking University Beijing China Department of Information Engineering Chinese University of Hong Kong Sha Tin Hong Kong China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication & Department of EEIS University of Science and Technology Hefei Anhui China Microsoft Research Asia Beijing China

ISBN: (纸本)0769523722

We simultaneously approach two tasks of nonlinear discriminant analysis and kernel selection problem by proposing a unified criterion, Fisher+Kernel criterion. In addition, an efficient procedure is derived to optimize this new criterion in an iterative manner. More specifically, original input vector is first transformed into a higher dimensional feature matrix through a battery of nonlinear mappings involved in different kernels. Then, based on the feature matrices, FKC is presented within two coupled projection spaces: one projection space is used to search for the optimal combinations of kernels; while the other encodes the optimal nonlinear discriminating projection directions. Our proposed method is a unified framework for both kernel selection and nonlinear discriminant analysis. Besides, the algorithm potentially alleviates overfitting problem existing in traditional KDA and has no singularity problems in most cases. The effectiveness of our proposed algorithm is validated by extensive face recognition experiments on several datasets.

关键词： Kernel Laboratories Asia Face recognition Linear discriminant analysis Design optimization Chaotic communication multimedia computing Batteries Couplings

来源：评论

学校读者我要写书评

暂无评论

Discriminant analysis with tensor representation

Discriminant analysis with tensor representation

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Shuicheng Yan Dong Xu Qiang Yang Lei Zhang Xiaoou Tang Hong-Jiang Zhang Department of Information Engineering Chinese University of Hong Kong Sha Tin Hong Kong China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication & Department of EEIS University of Science and Technology Hefei Anhui China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China Microsoft Research Asia Beijing China

ISBN: (纸本)0769523722

In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First, we propose a discriminant tensor criterion (DTC), whereby multiple interrelated lower-dimensional discriminative subspaces are derived for feature selection. Then, a novel approach called k-mode cluster-based discriminant analysis is presented to iteratively learn these subspaces by unfolding the tensor along different tensor dimensions. We call this algorithm discriminant analysis with tensor representation (DATER), which has the following characteristics: 1) multiple interrelated subspaces can collaborate to discriminate different classes; 2) for classification problems involving higher-order tensors, the DATER algorithm can avoid the curse of dimensionality dilemma and overcome the small sample size problem; and 3) the computational cost in the learning stage is reduced to a large extent owing to the reduced data dimensions in generalized eigenvalue decomposition. We provide extensive experiments by encoding face images as 2nd or 3rd order tensors to demonstrate that the proposed DATER algorithm based on higher order tensors has the potential to outperform the traditional subspace learning algorithms, especially in the small sample size cases.

关键词： Tensile stress Iterative algorithms Linear discriminant analysis Scattering Asia Image coding Clustering algorithms Algorithm design and analysis Principal component analysis Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共13页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：