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

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Xin Zhao Li Zhang Siwei Ma Wen Gao Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Institute of Digital Media Peking University Beijing China

In this paper, a novel algorithm is proposed for intra-frame coding, named as rate-distortion optimized transform (RDOT). Unlike existing intra-frame coding schemes where the transform matrices are either fixed or mode dependent, in the proposed algorithm, transform is implemented with multiple candidate transform matrices. With this flexibility, for coding each residual block, the encoder is endowed with the power to select the optimal transform matrix in terms of rate-distortion tradeoff. The proposed algorithm has been implemented in the latest ITU-T VCEG-KTA software. Experimental results show that, over a wide range of test set, the proposed method achieves average 0.43dB coding gain compared with the recent Mode-Dependent Directional Transform (MDDT). The improvement is more significant at high bit-rates, and up to 1dB coding gain can be achieved.

关键词： Transforms Encoding Image coding IP networks Training Decoding Gain

来源：评论

学校读者我要写书评

暂无评论

Subspace selection using semi-supervised harmonic mean of Kullback-Leibler divergences

Subspace selection using semi-supervised harmonic mean of Ku...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Si-Bao Chen Hai-Xian Wang Bin Luo Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei Anhui China Key Lab of Child Development and Learning Science of Ministry of Education Research Center of Learning Sciences South-East University Nanjing Jiangsu China

In many areas of pattern recognition and machine learning, subspace selection is an essential step. Fisher's linear discriminant analysis (LDA) is one of the most well-known linear subspace selection methods. However, LDA suffers from the class separation problem. The projection to a subspace tends to merge close class pairs. A recent result, named maximizing the geometric mean of Kullback-Leibler (KL) divergences of class pairs (MGMD), can significantly reduce the class separation problem. Furthermore, maximizing the harmonic mean of Kullback-Leibler (KL) divergences of class pairs (MHMD) emphasizes smaller divergences more than MGMD, and deals with the class separation problem more effectively. However, in many applications, labeled data are very limited while unlabeled data can be easily obtained. The estimation of divergences of class pairs is unstable using inadequate labeled data. To take advantage of unlabeled data for subspace selection, semi-supervised MHMD (SSMHMD) is proposed using graph Laplacian as normalization. Quasi-Newton method is adopted to solve the optimization problem. Experiments on synthetic data and real image data show the validity of SSMHMD.

关键词： Harmonic analysis Training Laplace equations Manifolds Covariance matrix Machine learning Symmetric matrices

来源：评论

学校读者我要写书评

暂无评论

Risk analysis of physical protection system based on evidence theory

引用

Journal of information and Computational Science 2010年第13期7卷 2871-2878页

作者： Xu, Peida Su, Xiaoyan Wu, Jiyi Sun, Xiaohong Zhang, Yajuan Deng, Yong College of Computer and Information Sciences Southwest University Chongqing 400715 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University Zhejiang 310036 China College of Food Science and Technology Shanghai Ocean University Shanghai 201306 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan 411105 China Key Subject Laboratory of National defense for Radioactive Waste and Environmental Security Southwest University of Science and Technology Mianyang 621010 China School of Electronics and Information Technology Shanghai Jiao Tong University Shanghai 200240 China

Risk evaluation is very important to the design and improvement of physical protection systems. In this paper, an evaluation method of multi-source information fusion is proposed based on the D-S evidence theory. In the proposed method, each individual component of the protection system in the simulated plane is modeled. Then, the threat report of each component according to the specific tactics is determined based on its real environment. Finally, the comprehensive threat distribution is obtained based on through the D-S evidence theory to combine multi-sources information. The proposed method can easily applied to the evaluation of the effectiveness of the protection system. We make the total threat of the protection system lowest through changes of the protection resources allocation. A numerical example is used to illustrate the efficiency of the proposed method. Copyright © 2010 Binary information Press.

关键词： information fusion

来源：评论

学校读者我要写书评

暂无评论

Automatically organize web text resources with frequent term tree

Automatically organize web text resources with frequent term...

引用

IEEE 9th International Conference on Computer and information Technology, CIT 2009

作者： Wang, Xiaofeng Shi, Zhongzhi Key Lab. of Intelligent Information Processing Institute of Computing Technology Graduate University of Chinese Academy of Sciences Beijing China Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769538365

With the expansion of the Web, automatically organizing large scale text resources, e.g. Web pages, becomes very important. Many Web sites, like Google and Yahoo, use hierarchical classification trees to organize text resources in Web. User can easily find the text resources that meet their requirements by navigating these hierarchical classification trees. Typically, the text resources in Web are manually assigned to the nodes of the hierarchical classification tree. This limits the hierarchical classification tree to organize large scale text resources. In this paper, we propose a Frequent Term Tree to improve the ability of hierarchical classification tree in organizing large scale text resources in Web. Different from the Fp-tree [17] which is utilized to efficiently discover frequent patterns, the frequent term tree is used to organize resources with frequent pattern based classification. The Frequent Term Tree can accurately assign text resources to each node of classification tree and improve the ability in organizing resources with the incremental classified text resources. The evaluation of the Frequent Term Tree demonstrates that Frequent Term Tree can effectively and efficiently organize text resources. © 2009 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

A new population diversity model in intelligence optimization algorithms

A new population diversity model in intelligence optimizatio...

引用

2009 International Conference on Computational Intelligence and Security, CIS 2009

作者： Feng, Jiqiang Xie, Weixin Xu, Chen Key Lab. for Intelligent Information Processing Shenzhen University Shenzhen China Institute of Intelligent Computing Science Shenzhen University Shenzhen China

ISBN: (纸本)9780769539317

A mathematical framework based on probability theory is presented that enables us to analyze one important aspect of SI algorithms: the population diversity. Firstly the population density degree is defined for the population in the SI algorithms. The population diversity is then discussed from the point of view of the normal distribution in statistics. We show that there is a close connection between the distribution and population diversity and that the essential structure of population diversity is quite similar to that of the distribution. A detailed construction of the population diversity model is then given that is based on probability distributions. The paper concludes with a generic numerical example that validates the population diversity model. © 2009 IEEE.

关键词： Normal distribution

来源：评论

学校读者我要写书评

暂无评论

Automatic adaptation of annotation standards for dependency parsing - Using projected treebank as source corpus 11

Automatic adaptation of annotation standards for dependency ...

引用

11th International Conference on Parsing Technologies, IWPT 2009

作者： Jiang, Wenbin Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing100190 China

We describe for dependency parsing an annotation adaptation strategy, which can automatically transfer the knowledge from a source corpus with a different annotation standard to the desired target parser, with the supervision by a target corpus annotated in the desired standard. Furthermore, instead of a hand-annotated one, a projected treebank derived from a bilingual corpus is used as the source corpus. This benefits the resource-scarce languages which haven't different hand-annotated treebanks. Experiments show that the target parser gains significant improvement over the baseline parser trained on the target corpus only, when the target corpus is smaller. © 2009 Association for Computational Linguistics

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

A fast thinning algorithm for fingerprint image

A fast thinning algorithm for fingerprint image

引用

1st International Conference on information Science and Engineering, ICISE2009

作者： Xiang, Ming Wu, Xiaopei Hua, Quanping Key Lab. of Intelligent Computing and Signal Processing Anhui University Hefei230039 China Department of Information Engineering Zhejiang Textile and Fashion College Ningbo315211 China

ISBN: (纸本)9780769538877

Thinning algorithms can be classified into two general types: serial and parallel algorithms. Several algorithms have been proposed, but they have limitations. A new thinning algorithm based on the centroid of the block is presented. The new algorithm checks the 9*9 local neighborhoods around the pixel to find out the centroid pixel of the block, and other pixels are removed. The process is performed iteratively until less than ten pixels are deleted in one loop. To ensure the ridge is one pixel wide, a post-processing loop is designed and the pixels are deleted from the image if they satisfy some conditions. Experimental results are used to compare this new algorithm to other algorithms and their relative performances are assessed. The new algorithm is fast than other algorithms and the ridges are one pixel wide after thinned. ©2009 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

A texture images segmentation method based on ICA filters

A texture images segmentation method based on ICA filters

引用

5th International Conference on Natural Computation, ICNC 2009

作者： Duan, Lijuan Jicai, Ma Miao, Jun Qiao, Yuanhua College of Computer Science and Technology Beijing University of Technology Beijing 100022 China Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijingl00190 China

ISBN: (纸本)9780769537368

In this paper we present a feature extraction approach by using ICA filters bank, which consists of the ICA basis images learned from the training images. On the basis of its ability to capture the inherent properties of textured image, we use the ICA filters bank as template model to extract the texture feature for segmentation. Experiments based on clustering and classifications are demonstrated to show the feasibility of this method. © 2009 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Theoretical insight into business workflow virtualization of E-commerce

Theoretical insight into business workflow virtualization of...

引用

1st International Conference on information Science and Engineering, ICISE2009

作者： Hong, Daocheng Li, Yangmei Department of Information Management and Information Systems Shanghai Key Lab. of Intelligent Information Processing Fudan University Shanghai China Research Center for Marketing Shanghai China Express Co. Ltd. Shanghai China

ISBN: (纸本)9780769538877

In our daily life, more and more commercial activities that have traditionally been conducted via physical mechanisms are being conducted virtually by means of information technologies (ITs). With the tendency of increasing virtualization of e-commerce, it's necessary to study the emerging phenomena from a novel theoretical perspective. According to previous literature communication media have been playing a vital role in IT-enabled business workflow virtualization. This research focuses on business workflow and proposes theoretical insight from media characteristic and relevant perspective. This study provides a new theoretical insight into workflow virtualization and workflow management, which are playing the core role in the research field of e-commerce. Finally, this work also presents potential future research for workflow management. ©2009 IEEE.

关键词： Workflow management

来源：评论

学校读者我要写书评

暂无评论

Sub-sentence division for tree-based machine translation

Sub-sentence division for tree-based machine translation

引用

Joint Conference of the 47th Annual Meeting of the Association for Computational Linguistics and 4th International Joint Conference on Natural Language processing of the AFNLP, ACL-IJCNLP 2009

作者： Xiong, Hao Xu, Wenwen Mi, Haitao Liu, Yang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Key Lab. of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China

ISBN: (纸本)9781617382581

Tree-based statistical machine translation models have made significant progress in recent years, especially when replacing 1-best trees with packed forests. However, as the parsing accuracy usually goes down dramatically with the increase of sentence length, translating long sentences often takes long time and only produces degenerate translations. We propose a new method named subsentence division that reduces the decoding time and improves the translation quality for tree-based translation. Our approach divides long sentences into several sub-sentences by exploiting tree structures. Large-scale experiments on the NIST 2008 Chinese-to-English test set show that our approach achieves an absolute improvement of 1.1 BLEU points over the baseline system in 50% less time. © 2009 ACL and AFNLP.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：