检索结果-南通市图书馆

A fast block mode selection approach for H.264 visual coding

Frontiers of Electrical and Electronic Engineering in China 2006年第4期1卷 431-436页

作者： LIN Wei-yao Fang Xiang-zhong HUANG Xiu-chao LI Dian LIU Xiao-feng Institute of Image Communication and Information Processing Shanghai Jiao Tong UniversityShanghai 200030China

In this paper,a new fast mode-selection ap-proach is proposed.This algorithm combines the proposed approaches of mode pre-decision and precise large-small mode decision,by selecting the best mode efficiently.Ex-perimental results show that the proposed approach can re-duce the computational cost of full search and fast multi-block motion estimation by 80%and 45%,respec-tively,with similar visual quality and bit rate.The proposed algorithm also reduces by 75%the computational cost of the large-small mode isolation algorithm for low-motion sequence coding,and with 0.06 PSNR gain and 3.7%re-duction in bit rate.

关键词： video coding H.264 inter mode optimization algorithm

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Structural optimization of Flood Control Screw Piles: A Review

Structural Optimization of Flood Control Screw Piles: A Revi...

引用

作者： Kun Hu Yanqin Tang Fanfei Jia Yuxing Wang School of Engineering South China Agricultural University

This paper discusses the importance of research on flood control piling equipment, and lists the existing domestic flood control piling equipment. The research status of screw piles at home and abroad in recent ten years is summarized from three aspects: bearing capacity, installation torque, stress and strain of soil. This paper introduces some optimization methods closely related to screw piles, such as evolutionary algorithm, neural network, numerical simulation optimization method, and makes a comparative analysis of the optimization methods that can be adopted for the screw pile.at last Several directions which need to be further studied in the future are put forward.

关键词： screw piles optimization algorithm numerical simulation pile driving flood control

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

The application of Multipoint Rotate-vector optimization method on the On-line Identification based Optimal Control（OIOC）

The application of Multipoint Rotate-vector Optimization met...

引用

2011 International Conference on Fluid Power and Mechatronics

作者： Boya ZHANG Zongxia JIAO Rongjie KANG Shuai WU Pan ZHAO Science and Technology on Aircraft Control Laboratory Beihang University Beijing China

The basic rotate-vector optimization method （BROM）is a direct optimization algorithm and is valuable to engineering application.Multipoint rotate-vector optimization method（MROM）is an improved algorithm based on BROM.In the On-line Identification based Optimal Control（OIOC）scheme, the author apply MROM to optimize the PID controller,the simulation is done on the co-simulation platform and the result showed its effectiveness and convergence.

关键词： optimization algorithm multipoint rotate-vector PID controller.

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

The Contraction-Expansion algorithm and Its Use in Fitting Nonlinear Equation

引用

生物数学学报 1998年第4期13卷 426-434页

作者： Gu Shiliang Hui Dafeng Bian Aihua(Quantitative Genetics Lab,Agricultural college,Yangzhou University,Yangzhou,225009) 扬州大学农学院江苏扬州

A new optimization method,contraction-expansion algorithm,is devel-oped and applied to fit nonlinear quations.Five points with equal distance are allocated in the given initial intervals,then the algorithm searches for the points of better objective function one round after another,with contracting and expanding intervals alternatively.The step length(l),a critical factor to optimal solution,is determined and adjusted by feedback information of the searching process.The experiments with number of simulat-ed and real data sets show that the new algorithm is much easier to the optimization than other methods.The algorithm does not need to provide derivatives of the equation.This algorithm can also be used in other ptimization problems.

关键词： optimization algorithm nonlinear equation fitting contraction-ex-pansion algorithm

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Global optimization for Semi-supervised K-means

Global Optimization for Semi-supervised K-means

引用

2009 Asia-Pacific Conference on Information Processing

作者： Xue Sun 1 Kunlun Li 1 Rui Zhao 1 1. College of Electronic and Information Engineering Hebei University Baoding China Xikun Hu 2 2. Industral and Commercial College Hebei University Baoding China

So far most of the K-means algorithms use the number of the labeled data as the K value, but sometimes it doesn’t work well. In this paper, we propose a semi-supervised K-means algorithm based on the global optimization. It can select an appropriate number of clusters as the K value directly and plan a great amount of supervision data by using only a small amount of the labeled data. Combining the distribution characteristics of data sets and monitoring information in each cluster after clustering, we use the voting rule to guide the cluster labeling in the data sets. The experiments indicated that the global optimization algorithm for semi-supervised K-means is quite helpful to improve the K-means algorithm, it can effectively find the best data sets for K values and clustering center and enhancing the performance of clustering.

关键词： Semi-supervised clustering optimization algorithm K-means Threshold

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Modifled PSO algorithm for solving planar graph coloring problem

引用

Progress in Natural Science:Materials International 2008年第3期 353-357页

作者： Guangzhao Cui a, Limin Qin a, Sha Liua, Yanfeng Wang a, Xuncai Zhang b, Xianghong Cao a a College of Electrical and Electronic Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China b Research Institute of Biomolecular Computer, Huazhong University of Science and Technology, Wuhan 430074, China

The graph coloring is a classic NP-complete problem. Presently there is no effective method to solve this problem. Here we propose a modifled particle swarm optimization (PSO) algorithm in which a disturbance factor is added to a particle swarm optimizer for improv- ing its performance. When the current global best solution cannot be updated in a certain time period that is longer than the disturbance factor, a certain number of particles will be chosen according to probability and their velocities will be reset to force the particle swarm to get rid of local minimizers. It is found that this operation is helpful to improve the performance of particle swarm. Classic planar graph coloring problem is resolved by using modifled particle swarm optimization algorithm. Numerical simulation results show that the per- formance of the modified PSO is superior to that of the classical PSO.

关键词： Planar graph coloring problem PSO optimization algorithm

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Prior information-based optimization for electrical tomographic imaging

Prior information-based optimization for electrical tomograp...

引用

第三十九届中国控制会议

作者： Jian LU Shihong YUE Haitao MA Sidolla YEM Huaxiang WANG School of Electrical and Information Engineering Tianjin University

Electrical tomographic imaging（ETI） is an advanced technique that has been widely applied in many fields. But it’s application is greatly limited by its low spatial resolution which mainly caused by two inherent problems: ill-posed solution and "soft field" effect. Even many optimizing methods have been applied to overcome these problems and have made some contributions to increase the ETI spatial resolution. Meanwhile, the ’prior information’ method has been demonstrated to be efficient and feasible. In this paper, we introduced the ’prior information’ method for the optimization of the spatial resolution of ETI process. To do this, we first recovered rich types of the prior information in an ETI process, and then introduced them to the ETI process. Based on the Tikhonov regularization and a traditional optimization method, this assessable prior information can greatly increase spatial resolution for typical flow patterns. Moreover, the reconstructed ETI optimal solution is more robust than the solutions achieved by other existing methods. Both theoretical analysis and experimental results strongly confirmed the priority of this new method. It also laid an important foundation for further wide usage of the prior information to improve the spatial resolution in other applications.

关键词： Electrical impedance imaging optimization algorithm Image reconstruction

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Genetic algorithm for Energy Efficient ＆ Coverage-Preserved Positioning in Wireless Sensor Networks

Genetic Algorithm for Energy Efficient ＆ Coverage-Preserved...

引用

2010 International Conference on Intelligent Computing and Cognitive Informatics (ICICCI 2010)

作者： Mojtaba Romoozi Mehdi Vahidipour Morteza Romoozi Sudeh Maghsoodi Member of Young Scholars Club Islamic Azad University KashanI.R.Iran Faculty of Engineering The University of Kashan KashanI.R.Iran Faculty of Engineering Islamic Azad University KashanI.R.Iran Student of Engineering Islamic Azad University KashanI.R.Iran

Layout is an important issue in designing sensor networks.This paper brings a new idea for the positioning of nodes in a wireless sensor network.The sensors communicate with each other to transmit their data to a high energy communication node which acts as an interface between data processing unit and sensors.optimization of sensor locations is essential to provide communication for a longer duration.An energy efficient layout with good coverage based on Genetic algorithm is proposed here.During the process of optimization,sensors move to form a uniformly distributed network.The two objectives taken into consideration are coverage and lifetime.Basically a set of network layouts are obtained.The simulation results also exhibit improvement of performance with increase in number of generations in the algorithm.

关键词： Wireless sensor networks Coverage Energy consumption Clustering algorithm optimization algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Research on Calibration and Compensation of the Installation Errors for GFSINS with Twelve-Accelerometers

Research on Calibration and Compensation of the Installation...

引用

2010 Third International Symposium on Knowledge Acquisition and Modeling (KAM 2010)

作者： Cui Min Ma Tie-hua Zhang Hui and Yang lei Key Laboratory of Instrumentation Science & Dynamic Measurement North University of China Tai Yuan 030051 china

In this paper, a physical model device of twelve-accelerometer’ inertial measurement unit is designed and manufactured to solve the High-speed projectile attitude angular estimation’s low precision’s problem. And proposing methods to calibrate misalignment angle and position installation error. According to the mathematical model of angular speed solving with the installation errors, nonlinear least squares is used to compensate accelerometers’ installation errors. Simulation result shows that this method can suppress installation errors effectively and acquire attitude of high efficiency. This method has some actual application value.

关键词： Twelve-accelerometer Installation error Calibration and compensation optimization algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

optimization of Connect6 based on Principal Variation Search and Transposition Tables algorithms

Optimization of Connect6 based on Principal Variation Search...

引用

第32届中国控制与决策会议

作者： Zhiyang Qi Xiaosong Huang Yu Shen Jiyun Shi School of Computer Science Beijing Institute of Technology

Connect6 is an intuitive and fair game with no first-hand advantage. Because of the large search tree, the search depth is often lower, to sacrifice strength of chess to improve search efficiency. In this case, this paper proposes an optimization algorithm for pruning Connect6 search tree based on the principal variation search and transposition tables algorithms. The optimization algorithm obtained PV node through searching, narrowed the pruning interval, and stored the key value of the situation into the transposition table through searching, and then directly returned the evaluation value when the same chess game was searched again, which greatly improved the search efficiency. Through a large number of repeated experiments, the effectiveness of the algorithm can be proved.

关键词： Connect6 PVS Transposition tables optimization algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：