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

Portrait image segmentation based on improved grabcut algorithm 6th

Portrait image segmentation based on improved grabcut algori...

6th International Conference on Swarm Intelligence, ICSI 2015 held in conjunction with the 2nd BRICS Congress on Computational Intelligence, CCI 2015

作者： Li, Shuai Zheng, Xiaohui Chen, Xianjun Zhan, Yongsong Key Laboratory of Cloud Computing and Complex System Guilin University of Electronic Technology Guilin Guangxi541004 China Guangxi Experiment Center of Information Science Guilin University of Electronic Technology Guilin Guangxi541004 China Key Laboratory of Intelligent Processing of Computer Image and Graphics Guilin University of Electronic Technology Guilin Guangxi541004 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin Guangxi541004 China Information Engineering School Haikou College of Economics Haikou Hainan571127

ISBN: (纸本)9783319204680

Traditional computer portrait caricature system mainly take the method that exaggerate and deform real images directly, that lead the facial image background also been deformed when exaggerate facial image. If in pretreatment stage, we segmented the characters and background of the input image, and then do the subsequent processing, the problem may be solved. But for better portrait caricature effects, we need an excellent segmentation algorithm. So, we propose an improved Grabcut image segmentation algorithm and use it to extract the prospect character image for exaggeration and deformation. In practical application, we separate deform and exaggerate the foreground characters image with TPS method, then fuse it with the original or new background picture, get the final image. Application proves, the method solves the background deformation problem well, and improves the quality and rate of image segmentation, caricature synthesis effect reality and natural. © Springer International Publishing Switzerland 2015.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Data clustering using particle swarm optimization

引用

9th FTRA InternationalConference on Future Information technology, FutureTech 2014

作者： Zhao, Mingru Tang, Hengliang Guo, Jian Sun, Yuan Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology College of Computer Science and Technology Beijing University of Technology Beijing 100124 China Beijing Key Laboratory of Intelligent Logistics System Beijing Wuzi University Beijing 101149 China

ISBN: (纸本)9783642550379

K-Means clustering algorithm attracts increasing focus in recent years. A pending problem of K-Means clustering algorithm is that the performance is affected by the original cluster centers. In this paper the K-Means algorithm is improved by particle swarm optimization and the initial cluster centers are generated by particle swarm *** experiments and comparisons with the classical K-Means algorithm indicate that the improved k-mean clustering algorithm has obvious advantages on execution time. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

HPS: a heuristic probabilistic search strategy based on node service capability

引用

Journal of Computational Information Systems 2014年第6期10卷 2621-2628页

作者： Mei, Hongyan Zhang, Yujie Meng, Xiangwu Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing 100876 China School of Computer Science Beijing University of Posts and Telecommunications Beijing 100876 China

Efficient searching for information is a challenging task in unstructured peer-to-peer networks due to the random nature of the peer-to-peer overlay links. In this paper, we propose a heuristic probabilistic search strategy based on node service capability called HPS, that increases the query hit rate with lower network consumption. HPS is an informed search algorithm that improves upon the adaptive probabilistic search(APS). The core principle of HPS is to utilize the node service capability to probabilistically guide the future search. We introduce a new neighbor selection criterion which allows a peer to evaluate the node service capability of its each neighbor node. The node service capability is based on the successful feedbacks from previous searches neighbor nodes lead to and the resource sharing capabilities of neighbor nodes. We also introduce a rare resource replication strategy to improve search efficiency and popularity of rare resource. Our simulation results confirm that HPS is capable of achieving about 7% increase in query hit rate and increase almost 50% in the query hit rate of rare resource with fewer messages number compared to APS. Copyright © 2014 Binary Information Press.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Vector Field Guidance for Three-Dimensional Curved Path Following with Fixed-Wing UAVs

Vector Field Guidance for Three-Dimensional Curved Path Foll...

引用

American Control Conference

作者： Yueqian Liang Yingmin Jia Junping Du Jun Zhang Seventh Research Division and the Center for Information and Control Beihang University (BUAA) Beijing 100191 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China School of Electronic and Information Engineering Beihang University (BUAA) Beijing 100191 China

ISBN: (纸本)9781479917730

This paper investigates the three-dimensional (3D) curved path following problem using fixed-wing unmanned aerial vehicles (UAVs) in the presence of constant wind disturbance. Vector field based approaches are used as the solution. Two vector fields are first developed, one is the tangent vector field based on path tangent vector and coordinate transformation, and the other is the combined vector field based on the combination of a conservative vector field and a solenoidal vector field. A unified jointly saturated course rate and saturated climb rate controller is designed based on the proposed vector fields. Simulations are conducted to demonstrate the effectiveness of the proposed approach.

关键词： Vector field Unmanned Aerial Vehicle fixed wings Coordinate transformations Tangent vector Wings Curved

来源：评论

学校读者我要写书评

暂无评论

Minimal exposure path algorithms for directional sensor networks

引用

Wireless Communications and Mobile Computing 2014年第10期14卷 979-994页

作者： Liu, Liang Zhang, Xi Ma, Huadong Beijing Key Lab of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing 100876 China Networking and Information Systems Laboratory Department of Electrical and Computer Engineering Texas AandM University College Station TX 77843 United States

As a fundamental problem of wireless sensor networks, the minimal exposure path problem corresponding to the sensor network's worst-case coverage plays an important role in the applications for detecting intrusions. However, most existing works about minimal exposure path are based on omnidirectional sensors. In contrast, this paper studies the minimal exposure path problem for two different types of directional sensing models: the binary sector model and directional sensitivity model. For the binary sector model, we construct a special Voronoi diagram, called sector centroids-based Voronoi diagram, to transform the minimal exposure path problem from a continuous geometric problem into a discrete geometric problem. By using the sector centroids-based Voronoi diagram, we develop an approximate algorithm to find the minimal exposure path in the sensors deployment field. For the directional sensitive model, we formulate the minimal exposure path problem by using two sensing intensity functions: all-sensor intensity function and maximum-sensor intensity function and then generate two weighted grids to convert the minimal exposure path problem into two discrete geometric problems. On the basis of the aforementioned weighted grids, we also develop two approximation algorithms to find the minimal exposure path for the directional sensitive model. We conduct extensive experiment simulations to validate and evaluate our proposed models and algorithms. Copyright © 2012 John Wiley & Sons, Ltd. As a fundamental problem of wireless sensor networks, the minimal exposure path problem corresponding to the sensor network's worst-case coverage plays an important role in the applications for detecting intrusions. This paper studies the minimal exposure path problem for two different types of directional sensing models: the binary sector model and directional sensitivity *** construct a special Voronoi diagram and two weighted grids to transform the minimal exposure path problem f

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Robust H∞ consensus control of uncertain multi-agent systems with nonlinear dynamics and time-varying delays

Robust H∞ consensus control of uncertain multi-agent system...

引用

2014 American Control Conference, ACC 2014

作者： Wang, Ping Jia, Yingmin Du, Junping Zhang, Jun Beijing 100191 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China Beijing 100191 China

ISBN: (纸本)9781479932726

This paper is concerned with the H∞ consensus control problem in undirected networks of autonomous agents with nonlinear dynamics, subject to parameter uncertainties and external disturbances. With the consideration of timevarying delays arising from communication among agents, a distributed protocol is proposed using the local delayed state information. Then, by defining an appropriate controlled output function, the consensus problem under the proposed protocol is converted into an H∞ control problem. Based on robust H∞ theory, sufficient conditions are derived to make all agents achieve consensus with desired H ∞ performance. Moreover, the feedback matrix in the proposed protocol is determined by solving two linear matrix inequalities (LMIs) with the same dimensions as a single agent. Finally, a numerical simulation is provided to demonstrate the effectiveness of our theoretical results. © 2014 American Automatic Control Council.

关键词： Robust control

来源：评论

学校读者我要写书评

暂无评论

ICA3D - intelligent computer-aided ancient Chinese architecture design 18

ICA3D - Intelligent computer-aided ancient Chinese architect...

引用

18th International Workshop of the European Group for intelligent Computing in Engineering, EG-ICE 2011

作者： Zhang, Songamo Lu, Ruqian Key Lab of Management Decision and Information Systems Academy of Mathematics and Systems Science Beijing China Beijing Key Laboratory of Multimedia and Intelligent Software Technology Beijing University of Technology Beijing China

ISBN: (纸本)9789036532167

ICA3D is an implemented computer aided system that helps user design ancient Chinese architecture. With ICA3D, the user can describe the building he/she wants to see in a domain specific Chinese natural language, and the system automatically generates an animation demonstrating the construction process of this building from scratch. This whole text-to-scene conversion is supported by a set of knowledge bases implemented by the Semantic Web technologies. Currently, ICA3D covers more than 180 different types of Chinese traditional buildings. Compared with normal CAD systems, ICA3D features the automatic generation of animation, natural language style user interface, and scalable knowledge infrastructure.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

Incoherent dictionary learning for sparse representation based image denoising

Incoherent dictionary learning for sparse representation bas...

引用

作者： Wang, Jin Cai, Jian-Feng Shi, Yunhui Yin, Baocai Beijing Key Laboratory of Multimedia and Intelligent Software Technology College of Metropolitan Transportation Beijing University of Technology Beijing100124 China Department of Mathematics University of Iowa Iowa CityIA52242 United States

ISBN: (纸本)9781479957514

Dictionary learning for sparse representation has been an active topic in the field of image processing. Most existing dictionary learning schemes focus on the representation ability of the learned dictionary. However, according to the theory of compressive sensing, the mutual incoherence of the dictionary is of crucial role in the sparse coding. Thus incoherent dictionary is desirable to improve the performance of sparse representation based image restoration. In this paper, we propose a new incoherent dictionary learning model that minimizes the representation error and the mutual incoherence by incorporating the constraint of mutual incoherence into the dictionary update model. The optimal incoherent dictionary is achieved by seeking an optimization solution. An efficient algorithm is developed to solve the optimization problem iteratively. Experimental results on image denoising demonstrate that the proposed scheme achieves better recovery quality and converges faster than K-SVD while keeping lower computation complexity. © 2014 IEEE.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

A path tracking search algorithm based on the credibility of node service ability

A path tracking search algorithm based on the credibility of...

引用

2014 IEEE Wireless Communications and Networking Conference, WCNC 2014

作者： Hongyan, Mei Yujie, Zhang Xiangwu, Meng Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing100876 China School of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China

ISBN: (纸本)9781479930838

Designing an efficient search algorithm is a key challenge in unstructured peer-to-peer networks in order to reduce redundant messages in the search process. Addressing the problem, in this paper, a path tracking search algorithm based on the credibility of node service ability(CNSA) is proposed. we utilize the credibility of node service ability as heuristic information to probabilistically guide the search. The credibility of node service ability is a new neighbor selection criterion which allows a peer to evaluate the credibility of its each neighbor based on the successful feedbacks from previous searches and the service capability of each neighbor node itself. Meanwhile, aiming to eliminate the repeat messages forwarding and reduce the number of redundant messages, the path tracking mechanism and the local messages caching mechanism are combined into CNSA. Our extensive simulation results show that CNSA can reduce the number of redundant messages, increase the query hit rate and adaptation to the dynamic characteristics of P2P networks. © 2014 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Centric bat algorithm for toy model of protein folding

引用

Sensor Letters 2014年第9期12卷 1388-1392页

作者： Xue, Fei Cai, Yongquan Cui, Zhihua College of Computer Science and Technology Beijing University of Technology Beijing China Complex System and Computational Intelligence Laboratory Taiyuan University of Science and Technology Shanxi China State Key Laboratory for Novel Software Technology Nanjing University Jiangsu China

The structure prediction of Toy model of protein folding is one challenging problem in Bioinformatics. Up to now, many computational intelligent algorithms have been applied to it. However, due to the amount of local optima, the accuracy is not well. In this paper, one new algorithm, centric bat algorithm is applied to solve this problem, to further improve the performance, a local search strategy, Limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) is also employed. The experimental results show it can predicts the protein folding structure precisely.

关键词： Protein folding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：