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

1st International Conference on Information Science and Engineering, ICISE2009

作者： Xuan, Shan-Li Liang, Dong Zhu, Ming Fan, Yi Zheng Wang, Nian Key Lab. Intelligent Computing and Signal Ministry of Education Anhui University Hefei 230039 China School of Mathematical Sciences Anhui University Hefei 230039 China School of Computer and Information HeFei University of Technology Hefei 230009 China

ISBN: (纸本)9780769538877

Based on the minimize spanning tree and Fiedler vector, a new feature matching algorithm is proposed in this paper. Firstly, a weighted complete graph is constructed with the feature points of each image respectively, then search the minimal spanning tree in each complete graph. Secondly, perform spectral decomposition on the Gaussian-weighted Laplace matrix of the minimize spanning tree respectively, and divide the feature points into several different sets based on the vector(Fiedler vector) corresponding to the second smallest eigenvalue of Laplace matrix , then the corresponding relation between sets is obtained. And construct Gaussian-weighted Laplace matrices between the corresponding sets, then submit the matrices to spectral decomposition. Finally, complete the feature matching by constructing matching matrix with eigenvalues and eigenvectors. Experiment results indicate that the algorithm has a high accuracy. ©2009 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

A novel method for segmentation of the cardiac MR images using generalized DDGVF snake models with shape priors

引用

Information technology Journal 2009年第4期8卷 486-494页

作者： Liu, Lixiong Wu, Yuwei Wang, Yuanquan Beijing Laboratory of Intelligent Information Technology School of Computer Science and Technology Beijing Institute of Technology Beijing 100081 China Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China

In this study, a novel method is presented for segmentation of the endocardium and epicardium of the left ventricle in cardiac magnetic resonance images using snake models. We first generalize the DDGVF snake model by introducing two spatially varying weighting functions which characterize the boundary information: this generalized DDGVF snake can conquer the spurious edges raised by artifacts while maintaining the desirable properties of DDGVF of distinguishing the positive and negative boundaries. This is especially helpful for the tasks on hand because the endocardium and epicardium of the LV in MR images can be characterized as positive and negative boundaries. Observed that the left ventricle is roughly a circle, a shape constraint based on circle is introduced into the snake model. This new constraint can prevent the snake contour from being trapped and leaking out so as to maintain the global shape of the snake contour during evolution. In addition, fourth-order PDEs are employed for noise removal. We demonstrate the proposed approach on an in vivo datasct and compare the segmented contours with manual collections;the results show its effectiveness. © 2009 Asian Network for Scientific Information.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Method with the center of graph for point pattern matching

Method with the center of graph for point pattern matching

引用

9th International Conference on Electronic Measurement and Instruments, ICEMI 2009

作者： Xuan, Shanli Liang, Dong Zhu, Ming Fan, Yizheng Wang, Nian Key Lab. Intelligent Computing and Signal Ministry of Education Anhui University Hefei 230039 China School of Computer and Information HeFei University of Technology Hefei 230009 China School of Mathematical Sciences Anhui University Hefei 230039 China

ISBN: (纸本)9781424438624

Based on the center of graph, a point pattern feature matching method is proposed here. Firstly, a weighted complete graph is constructed with the feature points of each image, and then the center of each graph is found respectively. With the vertex sets of the centers, the feature points are divided into several layers according to the distance from the center, and then the corresponding relation between layers is obtained. Secondly, the Gaussian-weighted Laplace matrices are constructed between the corresponding layers. And then the matrices are submitted to singular-value decomposition(SVD). Finally, represent the feature points with eigenvectors obtained from SVD, and then construct matching matrix to obtain the final matching results. Synthetic data and real world data both indicate that our method has a higher accuracy than theirs, and it can deal with the matching problem with more feature points effectively. ©2009 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Automatic adaptation of annotation standards: Chinese word segmentation and POS tagging - A case study

Automatic adaptation of annotation standards: Chinese word s...

引用

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

作者： Jiang, Wenbin 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 Google Research 1350 Charleston Rd. Mountain View CA 94043 United States

ISBN: (纸本)9781617382581

Manually annotated corpora are valuable but scarce resources, yet for many annotation tasks such as treebanking and sequence labeling there exist multiple corpora with different and incompatible annotation guidelines or standards. This seems to be a great waste of human efforts, and it would be nice to automatically adapt one annotation standard to another. We present a simple yet effective strategy that transfers knowledge from a differently annotated corpus to the corpus with desired annotation. We test the efficacy of this method in the context of Chinese word segmentation and part-of-speech tagging, where no segmentation and POS tagging standards are widely accepted due to the lack of morphology in Chinese. Experiments show that adaptation from the much larger People's Daily corpus to the smaller but more popular Penn Chinese Treebank results in significant improvements in both segmentation and tagging accuracies (with error reductions of 30.2% and 14%, respectively), which in turn helps improve Chinese parsing accuracy. © 2009 ACL and AFNLP.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Bilingually-constrained (monolingual) shift-reduce parsing

Bilingually-constrained (monolingual) shift-reduce parsing

引用

2009 Conference on Empirical Methods in Natural Language Processing, EMNLP 2009, Held in Conjunction with ACL-IJCNLP 2009

作者： Huang, Liang Jiang, Wenbin Liu, Qun Google Research 1350 Charleston Rd. Mountain View CA 94043 United States Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China

Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing approaches to employ complicated modeling and crude approximations. Here we propose a much simpler alternative, bilingually-constrained monolingual parsing, where a source-language parser learns to exploit reorderings as additional observation, but not bothering to build the target-side tree as well. We show specifically how to enhance a shift-reduce dependency parser with alignment features to resolve shift-reduce conflicts. Experiments on the bilingual portion of Chinese Treebank show that, with just 3 bilingual features, we can improve parsing accuracies by 0.6% (absolute) for both English and Chinese over a state-of-the-art baseline, with negligible (∼6%) efficiency overhead, thus much faster than biparsing. © 2009 ACL and AFNLP.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Method with the Center of Graph for Point Pattern Matching

Method with the Center of Graph for Point Pattern Matching

引用

2009 9th International Conference on Electronic Measurement & Instruments(第九届电子测量与仪器国际会议 ICEMI'2009)

作者： Shanli Xuan Dong Liang Nian Wang Ming Zhu Yizheng Fan School of Computer & Information HeFei University of TechnologyHefei230009China Key Lab Intelligent Computing & Signal Ministry of Education Anhui UniversityHefei230039China Key Lab Intelligent Computing & Signal Ministry of Education Anhui UniversityHefei230039China Sch

Based on the center of graph,a point pattern feature matching method is proposed ***,a weighted complete graph is constructed with the feature points of each image,and then the center of each graph is found *** the vertex sets of the centers,the feature points are divided into several layers according to the distance from the center,and then the corresponding relation between layers is ***,the Gaussian-weighted Laplace matrices are constructed between the corresponding layers. And then the matrices are submitted to singular-value decompositionfSVD).Finally,represent the feature points with eigenvectors obtained from sVD,and then construct matching matrix to obtain the final matching *** data and real world data both indicate that our method has a higher accuracy than theirs,and it can deal with the matching problem with more feature points effectively.

关键词： feature point center of graph Laplace matriz matching.

来源：评论

学校读者我要写书评

暂无评论

A generic approach to classify sports video shots and its application in event detection 09

A generic approach to classify sports video shots and its ap...

引用

1st International Conference on Internet Multimedia computing and Service, ICIMCS 2009

作者： Li, Lingfang Duan, Ling-Yu Huang, Qingming Du, Jun Gao, Wen Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Institute of Digital Media Peking University Beijing 100871 China Graduate University of Chinese Academy of Sciences Beijing 100190 China NEC Research Labs. China Beijing 100084 China

ISBN: (纸本)9781605588407

Shot type is useful information for semantic sports video analysis. Most existing approaches utilize predefined rules and domain knowledge to derive shot types in sports video. Although these methods have achieved promising results in some specific games, it is hard to extend them from one sport to another. To address this problem, we propose a generic approach to classify shots in sports video. Our approach utilizes bag of visual words model to represent key frame for each shot based on Scale Invariant Feature Transform (SIFT) feature points;either Support Vector Machine (SVM) or Probabilistic Latent Semantic Analysis (PLSA) are then employed to classify key frame to determine shot type. As our approach relies little on domain knowledge, it can be more easily extended to different sports. We have evaluated our shot classification approach over five types of sports video and have achieved promising results. To show the usefulness and effectiveness of our shot classification, we apply the results of shot type to detect events in basketball video via a generative-discriminative model. In addition, we have observed that some common visual parts frequently appear across various shots in the same sport or even different but relevant sports. For instance, soccer and basketball are relevant sports in the sense of field-ball game. Motivated by this observation, we attempt to alleviate the problem of insufficient sports video data in some applications by sharing these visual parts across different but relevant kinds of sports. Copyright 2009 ACM.

关键词： Sports

来源：评论

学校读者我要写书评

暂无评论

Automatic adaptation of annotation standards: Chinese word segmentation and POS tagging: a case study 09

Automatic adaptation of annotation standards: Chinese word s...

引用

Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1

作者： Wenbin Jiang Liang Huang Qun Liu Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Google Research Charleston Rd. Mountain View CA

ISBN: (纸本)9781932432459

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic sports genre categorization and view-type classification over large-scale dataset 09

Automatic sports genre categorization and view-type classifi...

引用

17th ACM International Conference on Multimedia, MM'09, with Co-located Workshops and Symposiums

作者： Li, Lingfang Zhang, Ning Duan, Ling-Yu Huang, Qingming Du, Jun Guan, Ling Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Ryerson Multimedia Research Laboratory Ryerson University Toronto ON Canada Institute of Digital Media Peking University Beijing 100871 China Graduate University of Chinese Academy of Sciences Beijing 100190 China NEC Research Labs. China Beijing 100084 China

ISBN: (纸本)9781605586083

This paper presents a framework with two automatic tasks targeting large-scale and low quality sports video archives collected from online video streams. The framework is based on the bag of visual-words model using speeded-up robust features (SURF). The first task is sports genre categorization based on hierarchical structure. Following on the second task which is based on automatically obtained genre, views are classified using support vector machines (SVMs). As a consequence, the views classification result can be used in video parsing and highlight extraction. As compared with state-of-the-art methods, our approach is fully automatic as well as domain knowledge free and thus provides a better extensibility. Furthermore, our dataset consists of 14 sport genres with 6850 minutes in total. Both sport genre categorization and view type classification have more than 80% accuracy rates, which validate this framework's robustness and potential in web-based applications. Copyright 2009 ACM.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

An Approach for Diagnosing Unexpected Faults in Web Service Flows

An Approach for Diagnosing Unexpected Faults in Web Service ...

引用

International Conference on Grid and Cooperative computing (GCC)

作者： Xu Han Zhongzhi Shi Wenjia Niu Fen Lin Donglei Zhang Key Lab. of Intell. Inf. Process. Chinese Acad. of Sci. Beijing Beijing China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

Potential faults have greatly reduced the dependability of business processes, so fault diagnosis is becoming an important issue which aims at supporting self-healing service flow execution. The existing fault handling mechanism provided by BPEL can only identify the faults which have been pre-defined in standards or by users. However, unexpected faults are also the main cause of failures in service flow execution. Therefore an effective diagnosis approach is needed to solve this problem. In this paper, we propose a logic-based approach for diagnosing unexpected faults in Web service flows. This approach uses dynamic description logic (DDL) to model business processes, and diagnoses faults based on DDL reasoning. We provide the DDL-based diagnosing algorithm, which takes process description and runtime information as inputs, and returns the related information of possible faults as the result. Moreover, to improve the efficiency of online diagnosis, the incremental DDL-based diagnosing algorithm is presented. Experimental results on a demo system show the effectiveness of this approach.

关键词： Web services Fault diagnosis Logic Grid computing laboratories Information processing Computers Testing Runtime Engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：