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

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

来源：评论

学校读者我要写书评

暂无评论

A novel Hebbian rules based method for computation of sparse coding basis vectors

A novel Hebbian rules based method for computation of sparse...

引用

5th International Conference on Natural Computation, ICNC 2009

作者： Zou, Baixian Miao, Jun Yang, Xiaoling Duan, Lijuan Qiao, Yuanhua Department of Information Science and Technology College of Arts and Science of Beijing Union University Beijing 100083 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Tianjin Academy of Agricultural Science Tianjin 300192 China College of Computer Science and Technology Beijing University of Technology Beijing 100022 China College of Applied Science Beijing University of Technology Beijing 100022 China

ISBN: (纸本)9780769537368

Sparse coding has high-performance encoding and ability to express images, sparse encoding basis vector plays a crucial role. The computational complexity of the most existing sparse coding basis vectors of is relatively large. In order to reduce the computational complexity and save the time to train basis vectors. A new Hebbian rules based method for computation of sparse coding basis vectors is proposed in this paper. A two-layer neural network is constructed to implement the task. The main idea of our work is to learn basis vectors by removing the redundancy of all initial vectors using Hebbian rules. The experiments on natural images prove that the proposed method is effective for sparse coding basis learning. It has the smaller computational complexity compared with the previous work. © 2009 IEEE.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Reasoning about Web Services with Local Closed World Assumption

Reasoning about Web Services with Local Closed World Assumpt...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Limin Chen Hong Hu Zhongzhi Shi CAS Key Laboratory of Intelligent Information Processing Institute of Computing Technology Beijing China Chinese Academy and Sciences Beijing China

This paper presents a formalism for representing and reasoning about Web services with local closed world assumption (LCWA) on the basis of $\mathcal{ALCO@K}$. In our formalism, the knowledge about the states of the world is encoded in $\mathcal {ALCO@}$-ABoxes; atomic services are represented in terms of their preconditions (epistemic queries to the knowledge base) and effects (possibly negated $\mathcal{ALCO@}$-assertions involving only atomic concepts); and composite services are built up with action constructors in dynamic logics. We also summarize some reasoning tasks and develop a calculus for them. Our formalism also enjoys \emph{introspection}. The main features of our proposal (i.e., dynamic reasoning, local closed world assumption and introspection) make it more philosophically satisfying and much closer towards a practical formalism for agents with incomplete knowledge in the Web full of static information and dynamic processing.

关键词： Web services intelligent agent Content addressable storage information processing Logic Calculus Semantic Web OWL Bridges Conferences

来源：评论

学校读者我要写书评

暂无评论

Web Service Composition as Satisfiability Checking in Dynamic Description Logics

Web Service Composition as Satisfiability Checking in Dynami...

引用

International Conference on Grid and Cooperative computing (GCC)

作者： Limin Chen Hong Hu Zhongzhi Shi Chinese Academy and Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

The automation of Web service composition (WSC) has emerged as a major research topic since an ever-increasing number of Web services are created and published, which make manually analyzing them and creating the desired composite service difficult, or even beyond human abilities. This paper presented an approach for the automation of WSC at the functional level based on dynamic description logics (DDLs), extensions of description logics (DLs) with a dynamic dimension. By embracing knowledge in actions into DLs, DDLs couple the static information provided by ontologies and the dynamic processing provided by Web services, and offer a uniform way to represent and reason about both static and dynamic aspects of the Web content. Our approach employed classical DL-TBoxes to capture the constraints of the domain, DL-ABoxes to describe the states, and DL-formulas to encode the client requirements respectively. Actions in DDLs were used to abstract the functionalities of the existing Web services which were classified into categories in terms of their functionalities. In such a way, the WSC was reduced to formula satisfiability and solved by a decidable tableau procedure. We also implemented a reasoning engine based on the dynamic description logic D-ALCHOQ, and tested our approach on a simple variation of the travel scenario; the preliminary results certified the potential of the approach.

关键词： Web services Automation information processing Computers Humans Logic testing Logic design Grid computing Ontologies Engines

来源：评论

学校读者我要写书评

暂无评论

Candidate generation for interactive Chinese speech recognition

Candidate generation for interactive Chinese speech recognit...

引用

Joint Conferences on Pervasive computing (JCPC)

作者： Xinhui Li Xiangdong Wang Yueliang Qian Shouxun Lin Chinese Academy and Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

ISBN: (纸本)9781424452279;9781424452286

Despite progress in automatic speech recognition, user involvement and assistance are still needed to achieve performance similar to human in real-world tasks. Though many interactive speech recognition systems using candidate selection are developed for English and Japanese, similar systems for Chinese face particular difficulties due to characteristics of the Chinese language, especially at the candidate generation stage. In this paper, a method is proposed for candidate generation in interactive Chinese speech recognition, which lists all competitive candidates in forms of Chinese characters in stead of words. The main idea is to align time-overlapped links in Chinese word lattice into clusters based on their phonetic similarity, and then obtain candidates by splitting words attached to links into Chinese characters. Experimental results demonstrated that the candidates generated by the proposed method can lead to high performance in interactive Chinese speech recognition.

关键词： Speech recognition Lattices Character generation Error correction Natural languages Humans Automatic speech recognition Laboratories Competitive intelligence information processing

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Model for Automatic Image Annotation and Retrieval

A Probabilistic Model for Automatic Image Annotation and Ret...

引用

International Conference on Computer and information technology (CIT)

作者： Zhixin Li Huifang Ma Zhiping Shi Zhongzhi Shi The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China Graduate University of Chinese Academy of Sciences Beijing China The Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences Beijing China

Automatic image annotation has become an important and challenging problem due to the existence of the semantic gap. In this paper, we present an approach based on probabilistic latent semantic analysis (PLSA) to achieve the task. In order to model training data precisely, an image is firstly represented as a bag of visual words, then a probabilistic structure with two PLSA models is employed to capture semantic information from visual and textual modalities respectively. Furthermore, an adaptive asymmetric learning approach is proposed to fuse the aspects of these two models. For each image document, the distribution over aspects of different models is fused by multiplying different weights, which are determined by the entropy of the feature distribution. Consequently, the two models are linked with the same distribution over all aspects. This structure can predict semantic annotation well for an unseen image because it associates visual and textual modalities properly. We compare our approach with several previous approaches on a standard Corel dataset. The experimental results show that our approach performs more effectively and accurately.

关键词： Image retrieval Image databases information retrieval Laboratories information processing Computers Fuses Indexing Feature extraction Spatial databases

来源：评论

学校读者我要写书评

暂无评论

Detecting Unusual Pattern with Labeled Data in Two-Stage

Detecting Unusual Pattern with Labeled Data in Two-Stage

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Jincheng Li Qing He Zhongzhi Shi Chinese Academy of Sciences Beijing China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

More analysis has been done to discover the meaningful unusual patterns which may mean fraud or anomaly. In this paper, a two-stage approach considering the labeled data's proposed to discover meaningful unusual observation, without the goal of classifying. We firstly apply hyper surface classification (HSC) algorithm to gain a separating hyper surface which includes several pieces. Observation in the sparse piece is viewed as the unusual pattern. For therpieces with local density, we construct a weighted graph for it and search the minimum spanning tree (MST), then detect further by cutting off several edges with the aximum weight. Combining the advantages of the two stages, a process of subdividing is proposed to consider the domain knowledge. Experimental results show that our approach can detect unusual pattern effectively together with other hidden valuable knowledge.

关键词： Pattern analysis Classification algorithms Credit cards Supervised learning Predictive models Fuzzy systems Laboratories information processing Computers information analysis

来源：评论

学校读者我要写书评

暂无评论

Exploring Web Resources in Social Annotation Services in Hierarchy

Exploring Web Resources in Social Annotation Services in Hie...

引用

International Conference on Grid and Cooperative computing (GCC)

作者： Kun Yang Zhongzhi Shi Chinese Academy and Sciences Beijing China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

This paper considers the problem of the organizing way of Web resources in social annotation systems. Currently, the Web resources in social annotation systems contain multiple topics, organizing them into different semantic clusters will facilitate userspsila browsing and search greatly. This paper proposes a hierarchy clustering method to organize Web resources in hierarchy by making full use of the linkage relationship between the Web resources and their annotations. In this way, users can browse or search a Web resource collection in a Google mappsilas way by going deep into a collection with more details. Some experiments on data set from *** are performed to justify the effectiveness of our method and a prototype based on pictures in Flickr is developed to demonstrate our idea.

关键词： Laboratories information processing Computers Organizing Grid computing Clustering methods Couplings Prototypes Clustering algorithms YouTube

来源：评论

学校读者我要写书评

暂无评论

Advertisement evaluation using visual saliency based on foveated image

Advertisement evaluation using visual saliency based on fove...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Zhiguo Ma Laiyun Qing Jun Miao Xilin Chen Chinese Academy and Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

This paper proposes a novel approach to advertisement evaluation using automatic salient regions. The salient regions are detected using a predicting model, in which the estimation are obtained by the space variant foveated image. The saliency is defined as the difference between the input image and its estimation. Then an advertisement is determined as attractive if the detected salient regions are overlapped with the interested regions of the advertisement. The experimental results on the advertisements data set are encouraging.

关键词： Computational modeling Humans Eyes Psychology Laboratories Computational intelligence information processing Computers Layout Machine learning

来源：评论

学校读者我要写书评

暂无评论

Detection of Front-View Vehicle with Occlusions Using AdaBoost

Detection of Front-View Vehicle with Occlusions Using AdaBoo...

引用

International Conference on information Engineering and Computer Science (ICIECS)

作者： Chunpeng Wu Lijuan Duan Jun Miao Faming Fang Xuebin Wang College of Computer Sciences Beijing University of Technology Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

ISBN: (纸本)9781424449934

In this paper, we propose a vehicle detection method based on AdaBoost. We focus on the detection of front-view car and bus with occlusions on highway. Samples with different occlusion situations are selected into the training set. By using basic and rotated Haar-like features extracted from the samples in the set, we train an AdaBoost-based cascade vehicle detector. The performance tests on static images and short time videos show that (1) our approach detects cars more effectively than buses (2) the real-time detection of our method on video proceeds at 30 frames per second.

关键词： Vehicle detection Feature extraction Prototypes Detectors Videos Educational institutions Road vehicles Face detection Boosting Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：