搜索资源列表
NSGA-II
- NSGA-II非支配排序遗传算法，可避免陷入局部最优，属于全局算法-NSGA-II non dominated sorting genetic algorithm, can avoid falling into local optimal, belong to the global algorithm
Mobile-robot-Location
- 本程序为基于几何地图方式的机器人定位matlab程序，利用地图匹配法定位，根据在局部地图中寻找完整线段与特征点，并在全局地图中寻找预制对应的线段-The programming is about the robot location which based the geometry map.this programming is used the method of map_matching ,in means of find the Complete Line Segments (CLS) a
Matlab_Code_TAFGLSE_ISCIDE_2013
- Texture-Aware Fast Global Level Set Evolution-Due to its intrinsic advantages such as the ability to automatically handle complex shapes and topological changes, the level set method has been widely used in image segmentation. Nevertheless, in additi
GAKMeans
- 由于Kmeans聚类分析是一个局部的搜索过程，因此加入遗传算法进行全局搜索选择最优的初始中心点使得Kmeans算法产生较大的改进-Since Kmeans Cluster analysis is a local search process, so join a global search for the genetic algorithm to the optimal initial centers such Kmeans algorithm produces greater improve
otsu
- otsu算法、局部二值化、全局二值化用于图像二值化。opencv3.0配置vs2013-Otsu algorithm, local two value, global two value for image two. Opencv3.0 configuration vs2013
OL
- 全局亮度与局部对比度自适应增强算法,一种简单有效的低照度图像处理算法。得到的增强图像色彩保持性好，算法简单快速。-Global and local contrast adaptive brightness enhancement algorithm, a simple and effective illumination image processing algorithms. The resulting color-enhanced image to maintain good algorit
PSOPT_Manual_R3
- PSOPT是以C++编写的开源的最优控制软件包,它采用直接配置法。这些方法求解最优控制问题，是使用全局或局部多项式来逼近随时间变化的各种变量，这就可以将微分方程和连续约束离散化，并可用众所周知的数值求积公式来计算与最优控制问题有关的任何积分，然后，非线性规划就可被用于求解局部最优解。-PSOPT is an open source optimal control package written in C++ that uses direct collocation methods. Thes
ZFTJHH
- 灰度图像的直方图均衡化的简单实现，包括局部和全局直方图均衡化-Gray-scale image histogram equalization simple implementation, including local and global histogram equalization
technology-to-fog
- 基于直方图优化的图像去雾技术； 三种去雾方法，包括局部直方图、全局直方图、retinex算法-Histogram-based image optimization technology to fog defogging three kinds of methods, including local histogram global histogram, retinex algorithm
Thalur-coloue-suggesatial
- by traditional level set based segmentation models. In this paper, we propose a new level set method integrating local and global intensity information adaptively to segment inhomogeneous images. The local image information is associated with the
CLGOpticflow
- 基于分层金字塔L-K微分法和局部全局相结合的运动估计算法CLG(Combined-local-Global)- The combination of motion estimation based on hierarchical pyramid L-K partial differential method and algorithm global CLG (Combined-local-Global)
GloVar
- 关于C++中，局部变量和全局变量的一般用法，方便维护管理-For the use of C++ in general, local and global variables, and easy maintenance
yihcuan
- 遗传算法在适应度函数选择不当的情况下有可能收敛于局部最优，而不能达到全局最优。-There may be genetic algorithm fitness function poorly chosen circumstances converge to local optimum, but can not reach the global optimum.
nef-1.4.0
- 非线性滤波框架（nef）,包括了 EKF,UKF,DDF1 DDF2,CDF,迭代滤波器,随机积分滤波器, 组合滤波器, 集合卡尔曼滤波, 高斯和滤波，粒子滤波，自回归最小二乘方法-nonlinear estimation framework (NEF) toolbox A. Implemeted local estimation techniques： a1. (extended) Kalman filter a2. Unscented Kalman filter a3.
disparity_postorocessing
- 立体匹配中，不管是局部还是全局匹配方法得到的视差图，需要对视差图进行后处理，比如左右一致性检验，遮挡过滤，中值滤波。-Stereo matching, whether local or global matching disparity map obtained after processing the need for the disparity map, such as about consistency checking, blocking filter, median filter.
Enhancement-Based-on-Visual-Property
- 常见的基于人类视觉特性的图像增强算法由于是同时完成动态范围压缩和对比度增强,导致增强图像的整 体对比度不高、边缘部分效果不佳.通过分析人类视觉系统的全局和局部自适应调节原理及人眼视网膜神经节细胞 感受野的传输特性,提出一种仿生图像增强算法.为适应人类视觉系统对光强的主观感觉特性,对图像作全局亮度 对数变换 并利用人眼的主观亮度感觉与实际光强的对数呈局部线性关系的特性,采用视网膜神经元感受野三高斯 模型来调整亮度图像的局部对比度 最后利用线性变换恢复图像的彩色信息.实验结果表明,该
POS_mod
- 改进的粒子群算法(PSO)MATLAB源程序m文件，在粒子群算法中引入克隆、选择算子寻求最优解。在同一粒子周围使用克隆选择算子进行多个方向的全局和局部搜索，促使种群中粒子快速进化，较快的得到局部最优和全局最优的位置-Improved particle swarm optimization algorithm (PSO) MATLAB source M files, in the particle swarm optimization algorithm to clone, the operat
SAPSO
- 为了平衡粒子群算法的全局搜索能力和局部改良能力，还可采用非线性的动态惯性权重公式。-In order to balance the global search ability of particle swarm optimization (pso) algorithm and local improvement ability, also can use nonlinear dynamic inertia weight formula.
quanjuliziqun
- 该程序为全局粒子群优化算法，进行优化计算时可避免陷入局部最优的陷阱。-The program for the global particle swarm optimization, optimization can be performed while avoiding local optimum trap.
DE-Clustering-Analysis
- 差分进化计算在解决这种聚类问题上表现出色，算法具有较强的通用性，不过分依赖于问题的信息；具有记忆个体最优解的能力、协同搜索的能力，以及可利用个体局部信息和群体全局信息指导算法进一步搜索的能力。-Differential evolutionary computation is excellent in solving this clustering problem. The algorithm has strong generality and can not depend on the info