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

Picture Coding Symposium, PCS

作者： Ling Yang Li Zhang Siwei Ma Debin Zhao Chinese Academy of Sciences Beijing China Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China Institute of Digital Media School of Electronic Engineering and Computer Science Peking University Beijing China Department of Computer Science and Engineering Harbin Institute of Technology Harbin China

This paper proposed a novel Region of Interest (ROI) based rate control algorithm for video communication systems, in which the subjective quality of ROI can be adjusted according to users' requirements. In the proposed scheme, in order to analyze the relationship between subjective quality and encoding parameters, a structural similarity index map - quantization parameter (SSIM-QP) model is established. Through this relation, the possible visual quality range of ROI is defined according to the range of ROI QP, which is predicted by rate control algorithm. Then, with interest levels being identified within the visual quality range, resources allocated to ROI is determined. Finally, considering both the quality of ROI and the entire frame, resource allocation is slightly adjusted. Experimental results demonstrate that the subjective visual quality of ROI in our proposed scheme can be adjustable improved compared to the existing rate control algorithms.

关键词： Bit rate Video coding Quadratic programming Humans Computer science Quantization Resource management Videoconference PSNR Data mining

来源：评论

学校读者我要写书评

暂无评论

Automatically discovering semantic links among documents

Automatically discovering semantic links among documents

引用

4th International Conference on Semantics, Knowledge, and Grid, SKG 2008

作者： Hai, Zhuge Junsheng, Zhang Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing China

ISBN: (纸本)9780769534015

Knowing semantic links among documents is the basis for intelligent applications over large-scale document resources. Discovering these semantic links with little human interference is a challenge issue. This paper proposes an approach to automatically discover semantic links in document set based on a probabilistic documentary semantic link network model. The approach has the following advantages: 1) It supports probabilistic relational reasoning. 2) The semantic link networks and relevant rules automatically evolve. 3) It does not rely on any predefined ontology. 4) It can adapt to the update of the adopted techniques. Experiments on document sets of different types (scientific papers and Web pages) and different scales show the proposed approach feasible. The approach can be used to automatically construct semantic overlays on large document sets to support advanced applications like various relational queries on scientific documents. © 2008 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Sgde-gep: A novel algorithm of gep

Sgde-gep: A novel algorithm of gep

引用

International Conference on Computer Science and Software Engineering, CSSE 2008

作者： Peng, Yu-Zhong Yuan, Chang-An Wang, Yan Qin, Xiao Key Lab of Scientific Computing Intelligent Information processing in Universities of Guangxi Guangxi Teachers Education University Nanning China

ISBN: (纸本)9780769533360

Traditional GEP algorithm takes up many system resources in decoding and evaluating due to the operation of the tree construction and corresponding traversing. This paper aims to introduce a novel GEP algorithm to alleviate the drawback mentioned above. The main contributions include:(1) presenting a new method for decoding and evaluating chromosome (SGDE), and proposing the corresponding ETs construction schema;(2) proving the relative natures of SGDE-GEP;(3)The experiments showed that the average efficiency of SGDE-GEP can be raised from 18.94% to 23.11% compared with the traditional GEP. © 2008 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

New algorithm of target classification in polarimetric SAR

引用

Journal of Systems Engineering and Electronics 2008年第2期19卷 273-279页

作者： Wang Yang Lu Jiaguo Wu Xianliang Key Lab of Intelligent Computing & Signal Processing of Ministry of Education Anhui Univ. Heifei 230039 P. R. China The 38th Research Inst. China Electronic Technology Corporation Hefei 230031 P. R. China

The different approaches used for target decomposition （TD） theory in radar polarimetry are reviewed and three main types of theorems are introduced： those based on Mueller matrix, those using an eigenvector analysis of the coherency matrix, and those employing coherent decomposition of the scattering matrix. Support vector machine （SVM）, as a novel approach in pattern recognition, has demonstrated success in many fields. A new algorithm of target classification, by combining target decomposition and the support vector machine, is proposed. To conduct the experiment, the polarimetric synthetic aperture radar （SAR） data are used. Experimental results show that it is feasible and efficient to target classification by applying target decomposition to extract scattering mechanisms, and the effects of kernel function and its parameters on the classification efficiency are significant.

关键词： polarimetric synthetic aperture radar target decomposition support vector machine target classification kernel function.

来源：评论

学校读者我要写书评

暂无评论

Refinements in BTG-based Statistical Machine Translation 3

Refinements in BTG-based Statistical Machine Translation

引用

3rd International Joint Conference on Natural Language processing, IJCNLP 2008

作者： Xiong, Deyi Zhang, Min Aw, Aiti Mi, Haitao Liu, Qun Lin, Shouxun Human Language Technology Institute for Infocomm Research 21 Heng Mui Keng Terrace 119613 Singapore Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100080 China

Bracketing Transduction Grammar (BTG) has been well studied and used in statistical machine translation (SMT) with promising results. However, there are two major issues for BTG-based SMT. First, there is no effective mechanism available for predicting orders between neighboring blocks in the original BTG. Second, the computational cost is high. In this paper, we introduce two refinements for BTG-based SMT to achieve better reordering and higher-speed decoding, which include (1) reordering heuristics to prevent incorrect swapping and reduce search space, and (2) special phrases with tags to indicate sentence beginning and ending. The two refinements are integrated into a well-established BTG-based Chinese-to- English SMT system that is trained on largescale parallel data. Experimental results on the NIST MT-05 task show that the proposed refinements contribute significant improvement of 2% in BLEU score over the baseline system. © 2008 IJCNLP 2008 - 3rd International Joint Conference on Natural Language processing, Proceedings of the Conference. All rights reserved.

关键词： Computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

Focused crawling with heterogeneous semantic information

Focused crawling with heterogeneous semantic information

引用

2008 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2008

作者： Huang, Rui Lin, Fen Shi, Zhongzhi Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences 100190 Beijing China Graduate University Chinese Academy of Sciences 100049 Beijing China

ISBN: (纸本)9780769534961

Focused crawlers selectively retrieve Web documents that are relevant to a predefined set of topics. To intelligently make predictions and decisions about relevant URLs and web pages, different topic models have been introduced to represent topic-specific knowledge. Yet it is difficult to support semantic interoperability among different models. Moreover, some manually specified additional semantic information, such as semantic markups and social annotations, could not be effectively used to improve crawling. This paper proposes to boost focused crawling with four kinds of semantic models and semantic information, including thesauruses, categories, ontologies, and folksonomies. A statistical semantic association model is proposed to integrate different semantic models, represent heterogeneous semantic information, and support semantic relevance computation. A focused crawling framework is developed which adopts both keyword based contents and different kinds of additional information for relevance prediction and ranking. Experiments show that the proposed model and framework effectively integrates heterogeneous semantic information for focused crawling. © 2008 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Word lattice reranking for Chinese word segmentation and part-of-speech tagging

Word lattice reranking for Chinese word segmentation and par...

引用

22nd International Conference on Computational Linguistics, Coling 2008

作者： Jiang, Wenbin Mi, Haitao Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9781905593446

In this paper, we describe a new reranking strategy named word lattice reranking, for the task of joint Chinese word segmentation and part-of-speech (POS) tagging. As a derivation of the forest reranking for parsing (Huang, 2008), this strategy reranks on the pruned word lattice, which potentially contains much more candidates while using less storage, compared with the traditional n-best list reranking. With a perceptron classifier trained with local features as the baseline, word lattice reranking performs reranking with non-local features that can't be easily incorporated into the perceptron baseline. Experimental results show that, this strategy achieves improvement on both segmentation and POS tagging, above the perceptron baseline and the n-best list reranking. © 2008. Licensed to the Coling.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A cascaded linear model for joint Chinese word segmentation and part-of-speech tagging

A cascaded linear model for joint Chinese word segmentation ...

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Jiang, Wenbin Huang, Liang Liu, Qun Lü, Yajuan Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

We propose a cascaded linear model for joint Chinese word segmentation and partof- speech tagging. With a character-based perceptron as the core, combined with realvalued features such as language models, the cascaded model is able to efficiently utilize knowledge sources that are inconvenient to incorporate into the perceptron directly. Experiments show that the cascaded model achieves improved accuracies on both segmentation only and joint segmentation and part-of-speech tagging. On the Penn Chinese Treebank 5.0, we obtain an error reduction of 18.5% on segmentation and 12% on joint segmentation and part-of-speech tagging over the perceptron-only baseline. © 2008 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation

Forest-based translation

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Mi, Haitao Huang, Liang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

Among syntax-based translation models, the tree-based approach, which takes as input a parse tree of the source sentence, is a promising direction being faster and simpler than its string-based counterpart. However, current tree-based systems suffer from a major drawback: they only use the 1-best parse to direct the translation, which potentially introduces translation mistakes due to parsing errors. We propose a forest-based approach that translates a packed forest of exponentially many parses, which encodes many more alternatives than standard n-best lists. Large-scale experiments show an absolute improvement of 1.7 BLEU points over the 1-best baseline. This result is also 0.8 points higher than decoding with 30-best parses, and takes even less time. © 2008 Association for Computational Linguistics.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation rule extraction

Forest-based translation rule extraction

引用

2008 Conference on Empirical Methods in Natural Language processing, EMNLP 2008, Co-located with AMTA 2008 and the International Workshop on Spoken Language Translation

作者： Mi, Haitao Huang, Liang Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Dept. of Computer and Information Science University of Pennsylvania Levine Hall 3330 Walnut St. Philadelphia PA 19104 United States

Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of the bitext. The current dominant practice only uses 1-best trees, which adversely affects the rule set quality due to parsing errors. So we propose a novel approach which extracts rules from a packed forest that compactly encodes exponentially many parses. Experiments show that this method improves translation quality by over 1 BLEU point on a state-of-the-art tree-to-string system, and is 0.5 points better than (and twice as fast as) extracting on 30- best parses. When combined with our previous work on forest-based decoding, it achieves a 2.5 BLEU points improvement over the baseline, and even outperforms the hierarchical system of Hiero by 0.7 points. © 2008 Association for Computational Linguistics.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：