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

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

来源：评论

学校读者我要写书评

暂无评论

Research and implementation of continuous wave radar ranging method based on tri-frequency

引用

High Technology Letters 2014年第2期20卷 111-116页

作者：袁其平 Fan Lijieare Tong Zhengrong Yang Xiufeng Cao Ye School of Electronics Information Engineering Tianjin University of Technology Key Laboratory of Film Electronics and Communication Devices and Key Laboratory of Intelligent Computing and Novel Software Technolgy School of Computer and Communication EngineeringTianjin University of Technology

In the traditional dual-frequency radar ranging system,there is a contradiction between ranging precision and ranging *** a tri-frequency ranging method is *** principle of the tri-frequency ranging is that the distance can be achieved by transmitting the three frequencies and then measuring the three phase difference and calculating the number of ***'s more,range ambiguity will not occur within a certain *** experimental results show that,if the waveband is 0.47 ~0.57 m,the measurement of unambiguous distance of 25 ~500m can be *** the wavelength tolerance error is less than ± 10^(-7) and the phase error is less than ± 10^(-3),the precision of the distance ranging can reach 10^(-6).

关键词： tri-frequency ranging SNR phase error wavelength error

来源：评论

学校读者我要写书评

暂无评论

Judicial precedents search supported by natural language processing and clustering

Judicial precedents search supported by natural language pro...

引用

Colombian Conference on Computing (CCC)

作者： Manuel Alejandro Calambás Armando Ordóñez Angela Chacón Hugo Ordoñez Intelligent Management Systems Group Fundación Universitaria de Popayán Cauca Colombia Universidad Autónoma del Cauca Cauca Colombia Research Laboratory in Development of Software Engineering Universidad San Buenaventura Cali Colombia

The judicial precedent facilitates decision-making by judges based on previous sentences. However, legal professionals should look among a large number of documents sentences serve as support for its ongoing cases. This work shows the progress in developing a system that uses technologies of natural language processing and grouping (clustering) to optimize the process of search and analysis of these court documents.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tomography is Necessary for Universal Entanglement Detection with Single-Copy Observables

引用

Physical Review Letters 2016年第23期116卷 230501-230501页

作者： Dawei Lu Tao Xin Nengkun Yu Zhengfeng Ji Jianxin Chen Guilu Long Jonathan Baugh Xinhua Peng Bei Zeng Raymond Laflamme Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Ontario Canada State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua University Beijing 100084 China Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology Sydney NSW 2007 Australia Department of Mathematics and Statistics University of Guelph Guelph Ontario N1G 2W1 Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland 20742 USA Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics University of Science and Technology of China Hefei Anhui 230036 China Canadian Institute for Advanced Research Toronto Ontario M5G 1Z8 Canada Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada

Entanglement, one of the central mysteries of quantum mechanics, plays an essential role in numerous tasks of quantum information science. A natural question of both theoretical and experimental importance is whether universal entanglement detection can be accomplished without full state tomography. In this Letter, we prove a no-go theorem that rules out this possibility for nonadaptive schemes that employ single-copy measurements only. We also examine a previously implemented experiment [H. Park et al., Phys. Rev. Lett. 105, 230404 (2010)], which claimed to detect entanglement of two-qubit states via adaptive single-copy measurements without full state tomography. In contrast, our simulation and experiment both support the opposite conclusion that the protocol, indeed, leads to full state tomography, which supplements our no-go theorem. These results reveal a fundamental limit of single-copy measurements in entanglement detection and provide a general framework of the detection of other interesting properties of quantum states, such as the positivity of partial transpose and the k-symmetric extendibility.

关键词： Entanglement detection Entanglement measures Quantum tomography Nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

Shape Matching Optimization via Atomic Potential Function and Artificial Bee Colony Algorithms with Various Search Strategies

Shape Matching Optimization via Atomic Potential Function an...

引用

International Symposium on Computational Intelligence and Design, ISCID

作者： Bai Li Hongxin Cao Mandong Hu Changjun Zhou College of Control Science and Engineering Zhejiang University Hangzhou China Zhejiang University Hangzhou Zhejiang CN College of Software Technique Qingdao University Qingdao China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Dalian China

ISBN: (纸本)9781467395885

Visual shape matching is a critical topic in pattern recognition applications. Atomic potential matching (APM) model is a relatively new shape matching methodology inspired by potential field attractions. Compared to the conventional edge potential function model, APM not only encourages the right matching parts through attraction, but also repels the wrong matching parts. This feature enables APM to cope with targets that hide in the intricate background. This study comprehensively investigates the convergence performances of various state-of-the-art artificial bee colony (ABC) algorithms in shape matching problems on the basis of APM framework. Repeated simulations are conducted to evaluate the optimization abilities of the concerned ABC variants and experimental results indicate that the prevailing remedies for the conventional ABC algorithm, especially efforts made in the local exploitation phase, are not efficacious to promote optimization capability. Explanations regarding the comparative results are provided as well.

关键词： Shape Optimization Image edge detection Algorithm design and analysis Aircraft Visualization Mathematical model

来源：评论

学校读者我要写书评

暂无评论

A Highly Efficient Particle Swarm Optimizer for Super High-dimensional Complex Functions Optimization

A Highly Efficient Particle Swarm Optimizer for Super High-d...

引用

2014 IEEE 5th International Conference on software engineering and Service Science

作者： Kaiyou Lei Intelligent Software and Software Engineering Laboratory Southwest University

Because of the complexity of super high-dimensional complex functions with the large numbers of global and local optima,the general particle swarm optimization methods are slow speed on convergence and easy to be trapped in local *** this paper,a highly efficient particle swarm optimizer is proposed,which employ the adaptive strategy of inertia factor,global optimum,search space and velocity in each cycle to plan large-scale space global search and refined local search as a whole according to the fitness change of swarm in optimization process of the functions,and to quicken convergence speed,avoid premature problem,economize computational expenses,and obtain global *** test the new algorithm and compare it with other published methods on several super high dimensional complex functions,the experimental results showed clearly the revised algorithm can rapidly converge at high quality solutions.

关键词： particle swarm optimizer high-dimensional Complex function premature problem

来源：评论

学校读者我要写书评

暂无评论

A Fast Hybrid Optimization Algorithm Based on TS and PSO for Circles Packing Problem with the Equilibrium Constraints

A Fast Hybrid Optimization Algorithm Based on TS and PSO for...

引用

2014 IEEE 5th International Conference on software engineering and Service Science

作者： Kaiyou Lei Intelligent Software and Software Engineering Laboratory Southwest University

The packing problem with the behavioral constraints is difficult to solve due to its NP-hard *** search(TS)has strong global search ability but the convergence accuracy is *** swarm optimization(PSO) is quick in convergence,but likely to be premature at the initial *** both the advantages and disadvantages,a fast hybrid optimization algorithm based on improved TS and PSO for this problem is proposed,which employ the novel intensification search and diversification search balance strategy of TS and the refined search of PSO as a whole to plan large-scale space global search according to the fitness change,and to quicken convergence speed,avoid repeated search work,economize computational expenses,and obtain global *** proposed algorithm is tested and compared it with other published methods on constrained layout examples,demonstrated that the revised algorithm is feasible and efficient.

关键词： tabu search particle swarm optimization premature constrained layout

来源：评论

学校读者我要写书评

暂无评论

A highly efficient particle swarm optimizer for super high-dimensional complex functions optimization

A highly efficient particle swarm optimizer for super high-d...

引用

IEEE International Conference on software engineering and Service Sciences (ICSESS)

作者： Kaiyou Lei Intelligent Software and Software Engineering Laboratory Southwest University Chongqing China

Because of the complexity of super high-dimensional complex functions with the large numbers of global and local optima, the general particle swarm optimization methods are slow speed on convergence and easy to be trapped in local optima. In this paper, a highly efficient particle swarm optimizer is proposed, which employ the adaptive strategy of inertia factor, global optimum, search space and velocity in each cycle to plan large-scale space global search and refined local search as a whole according to the fitness change of swarm in optimization process of the functions, and to quicken convergence speed, avoid premature problem, economize computational expenses, and obtain global optimum. We test the new algorithm and compare it with other published methods on several super high dimensional complex functions, the experimental results showed clearly the revised algorithm can rapidly converge at high quality solutions.

关键词： Convergence Particle swarm optimization Search problems Optimization Heuristic algorithms Algorithm design and analysis Equations

来源：评论

学校读者我要写书评

暂无评论

A fast heuristic particle swarm optimization algorithm for circles packing problem with the equilibrium constraints

A fast heuristic particle swarm optimization algorithm for c...

引用

World Congress on intelligent Control and Automation (WCICA)

作者： Kaiyou Lei Intelligent Software and Software Engineering Laboratory Southwest University Chongqing China

The packing problem with the behavioral constraints is difficult to solve due to its NP-hard nature. Particle swarm optimization (PSO) is quick in convergence, but likely to be premature at the initial stage. Considering its characteristics, a fast heuristic PSO algorithm for this problem is proposed, which employ the heuristic method to get the initial approximate position of global optimum by randomly arranging round existing circles in peripheral with counter-clockwise movement, and the refined search of improved PSO as a whole to plan large-scale space global search according to the fitness change, and to quicken convergence speed, avoid premature problem, economize computational expenses, and obtain global optimum. The proposed algorithm is tested and compared it with other published methods on constrained layout examples, demonstrated that the algorithm is superior to the exiting algorithms in performance.

关键词： Layout Particle swarm optimization Search problems Optimization Convergence Heuristic algorithms software algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：