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

Chinese Conference on Pattern Recognition

作者： Huang, Xiangsheng Gong, Lujin Wang, Xiaoyan Institute of Automation Chinese Academy of Sciences Beijing 100190 China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing AMSS Beijing 100190 China College of Computer Science and Technology Zhejiang University of Technology Hangzhou 310023 China

ISBN: (纸本)9781424472109

Fast facial points fitting plays an important role in applications such as Human-computer Interaction, entertainment, surveillance, and is highly relevant to the techniques of facial expression analysis, face recognition, 3D face model generation, etc. Active Appearance Models (AAMs) are generative models commonly used to fit face. They are sensitive to illumination and expression changes because they use only raw intensity to build observation models. In this paper, a real time facial points fitting approach using mixture observation models is presented. Furthermore, the 3D modes are used to constrain the AAM so that it can only generate model instances that can also be generated with the 3D modes. Finally, we give a derivative process for fast energy minimization using the inverse compositional algorithm. A coarse-to-fine fitting strategy is used for realtime and robust facial points fitting. We apply this algorithm to facial expression cloning of 3D Avatar system. Experimental results demonstrate that fitting the AAM with mixture observation models and 3D constraint outperforms other classical algorithms. ©2010 IEEE.

关键词： Mixtures

来源：评论

学校读者我要写书评

暂无评论

Manifold alignment via corresponding projections

Manifold alignment via corresponding projections

引用

2010 21st British Machine Vision Conference, BMVC 2010

作者： Zhai, Deming Li, Bo Chang, Hong Shan, Shiguang Chen, Xilin Gao, Wen School of Computer Science and Technology Harbin Institute of Technology China Digital Media Research Center Institute of Computing Technology CAS China Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences China Institute of Digital Media Peking University China

ISBN: (纸本)1901725405

In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets. Different from the previous algorithms of semi-supervised manifold alignment, our method learns the explicit corresponding projections from each original observation space to the common embedding space everywhere. Benefiting from this property, our method could process new test data directly rather than re-alignment. Furthermore, our approach doesn't have any assumption on the data structures, thus it could handle more complex cases and get better results compared with previous work. In the proposed algorithm, manifold alignment is formulated as a minimization problem with proper constraints, which could be solved in an analytical manner with closed-form solution. Experimental results on pose manifold alignment of different objects and faces demonstrate the effectiveness of our proposed method. © 2010. The copyright of this document resides with its authors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Assignment reduct and its calculation method in inconsistent incomplete decision system

Assignment reduct and its calculation method in inconsistent...

引用

IEEE International Conference on Granular computing (GRC)

作者： Zuqiang, Meng Zhongzhi, Shi Hua, Qin College of Computer Electronics and Information Guangxi University Nanning 530004 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9780769541617

Attribute reduction is a basic issue in rough set theory. But related researches on reduction in inconsistent incomplete decision system (IIDS) are currently rarely reported. In this paper, the concept of assignment reduct is extended from inconsistent complete decision system (ICDS) to IIDS and then the property of assignment-core attribute is analysed, and finally a method to calculate assignment reduct is put forward by using the heritable trait of assignment reduct. Example analysis shows that the proposed method is effective. This work provides an effective solution for attribute reduction in IIDS. © 2010 IEEE.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Research on Ranking Support Vector machine and prospects

Research on Ranking Support Vector machine and prospects

引用

作者： Ding, Shi-Fei Liu, Xiao-Liang Zhang, Li-Wen School of Computer Science and Technology China University of Mining and Technology Xuzhou 221008 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)9787894631046

Learning to rank is designed to determine a ranking for the target objects according to some rule. Specifically, the problem about learning to rank is to learn a ranking function from a training set whose data has been ranked. It is most applied to the social sciences and information retrieval. Learning to rank is a hot issue in the field of information retrieval and machine learning at present. This paper analyses the process of Ranking Support Vector machine (RSVM) from a theoretical point of view from the classification and regression respectively, and sets up the two basic mathematical models about RSVM. The general introduction about RSVM in the application, training speed and generalization ability is also given. In the end, we come to a conclusion.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Outlier Detection for Learning-Based Optimizing Compiler

Outlier Detection for Learning-Based Optimizing Compiler

引用

Japan-China Joint Workshop on Frontier of computer Science and technology (FCST)

作者： Shun Long Weiheng Zhu Department of Computer Science Jinan University Guangzhou China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences China

Modern compilers use machine learning to find from their prior experience useful heuristics for new programs encountered in order to accelerate the optimization process. However, prior experience might not be applicable for outlier programs with unfamiliar code features. This paper presents a Reverse K-nearest neighbor (RKNN) algorithm based approach for outlier detection. The compiler can therefore launch a search within an optimization space when outlier programs are encountered, or directly apply its experience to non-outliers. Preliminary experimental results demonstrate the effectiveness of the approach.

关键词： Optimization Program processors Training Kernel Benchmark testing Arrays Nearest neighbor searches

来源：评论

学校读者我要写书评

暂无评论

On synchronization and evaluation method of chipped many-core processor

引用

Jisuanji Xuebao/Chinese Journal of computers 2010年第10期33卷 1777-1787页

作者： Xu, Wei-Zhi Song, Feng-Long Liu, Zhi-Yong Fan, Dong-Rui Yu, Lei Zhang, Shuai Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acad. of Sci. Beijing 100190 China Graduate University of Chinese Acad. of Sci. Beijing 100039 China

Synchronization schemes are critical for on-chip multi-core and many-core processor to execute correctly and communicate cooperatively. The efficiency of the synchronization is very important for the processor. In this paper, for on-chip many-core architecture, three types of synchronization schemes are proposed. That is, two types of coarse-grain synchronization schemes based on dedicated hardware support and atomic operation, and a fine-grain synchronization scheme based on Full/Empty bit. Then, the evaluation criterions and methods are proposed, in which quantitative evaluation micro-benchmarks are designed for coarse-grain synchronization schemes. Finally, the coarse-grain synchronization schemes are evaluated via a many-core architecture simulator, i.e., Godson-T, and AMD Opteron commercial on-chip multi-processor using pThread multi-thread program model. The results show that hardware support improves the performance of the synchronization obviously for on-chip many-core processor, and the performance loss of the traditional synchronization scheme based on atomic instructions is caused by the waiting cost of load imbalance and serialization on synchronization point mostly.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Extend atomic action definitions of DDL to support occlusions and conditional post-conditions

引用

作者： Chang, Liang Shi, Zhongzhi Gu, Tianlong School of Computer and Control Guilin University of Electronic Technology Guilin 541004 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)3642163262

The dynamic description logic DDL provides a kind of action theories based on description logics (DLs). Compared with another important DL-based action formalism constructed by Baader ***., a shortcoming of DDL is the absence of occlusions and conditional post-conditions in the description of atomic actions. In this paper, we extend atomic action definitions of DDL to overcome this limitation. Firstly, we introduce extended atomic action definitions in which the occlusions and conditional post-conditions are incorporated. Secondly, for each atomic action specified by an extended atomic action definition, a function named Expand is introduced to transform it into a choice action which is composed of atomic actions defined by ordinary atomic action definitions. Finally, based on the Expand function, the satisfiability-checking algorithm of DDL is extended to support occlusions and conditional post-conditions. © 2010 IFIP.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

A dynamic description logic based system for video event detection

引用

Frontiers of Electrical and Electronic Engineering in China 2010年第2期5卷 137-142页

作者： Xiaofeng WANG Liang CHANG Zhixin LI Zhongzhi SHI The Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China Graduate University of Chinese Academy of Sciences Beijing 100049China School of Computer and Control Guilin University of Electronic TechnologyGuilin 541004China

Video event detection is an important research area *** the video event is a key problem in video event *** this paper,we combine dynamic description logic with linear time temporal logic to build a logic system for video event *** proposed logic system is named as LTD_(ALCO)which can represent and inference the static,dynamic and temporal knowledge in one uniform logic *** on the LTD_(ALCO),a framework for video event detection is *** video event detection framework can automatically obtain the logic description of video content with the help of ontology-based computer vision techniques and detect the specified video event based on satisfiability checking on LTD_(ALCO)formulas.

关键词： video event semantics dynamic description logics reasoning ontology

来源：评论

学校读者我要写书评

暂无评论

A domain-specific question answering system based on ontology and question templates

A domain-specific question answering system based on ontolog...

引用

11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed computing, SNPD2010

作者： Wang, D.S. Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Graduate University of the Chinese Academy of Sciences Beijing China Department of Computer Science Jiangsu University of Science and Technology Zhenjiang China

ISBN: (纸本)9780769540887

The rapid growth in the development of Internet-based information systems increases the demand for natural language interfaces that are easy to set up and maintain. Unfortunately, the problem of deep understanding natural language queries is far from being solved. In this paper, an automated question answering system based on domain ontology and question template is proposed, which does not need deep understanding of user's questions. Ontology was employed to model the interesting domain, and properties of concepts are described by a collection of question templates. The system captures a user's intention by matching his questions to predefined templates, and return answers corresponding to template's query focus. The system has been applied to mobile service consulting area, and experimental results show that the system has high practicability as well as maintainability. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Multicast capacity scaling for cognitive networks: General extended primary network

Multicast capacity scaling for cognitive networks: General e...

引用

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

作者： Wang, Cheng Li, Xiang-Yang Tang, Shaojie Jiang, Changjun Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States

ISBN: (纸本)9781424474882

We study the capacity scaling laws for the cognitive network that consists of the primary hybrid network (PhN) and secondary ad hoc network (SaN). PhN is further comprised of an ad hoc network and a base station based (BS-based) network. SaN and PhN are overlapping in the same deployment region, operate on the same spectrum, but are independent with each other in terms of communication requirements. The primary users (PUs), i.e., the ad hoc nodes in PhN, have the priority to access the spectrum. The secondary users (SUs), i.e., the ad hoc nodes in SaN, are equipped with cognitive radios, and have the functionalities to sense the idle spectrum and obtain the necessary information of primary nodes in PhN. We assume that PhN adopts one out of three classical types of strategies, i.e., pure ad hoc strategy, BS-based strategy, and hybrid strategy. We aim to directly derive multicast capacity for SaN to unify the unicast and broadcast capacity under two basic principles: (1) The throughput for PhN cannot be undermined in order sense due to the presence of SaN. (2) The protocol adopted by PhN does not alter in the interest of SaN, anyway. Depending on which type of strategy is adopted in PhN, we design the optimal-throughput strategy for SaN. We show that there exists a threshold of the density of SUs according to the density of PUs beyond which it can be proven that: (1) when PhN adopts the pure ad hoc strategy or hybrid strategy, SaN can achieve the multicast capacity of the same order as it is stand-alone;(2) when PhN adopts the BS-based strategy, SaN can asymptotically achieve the multicast capacity of the same order as if PhN were absent, if some conditions of the relations among the number of SUs, PUs, the destinations of each multicast sessions in SaN, and the base stations in PhN hold. ©2010 IEEE.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：