搜索资源列表
conjugategrads
- 图像重建常常被转化为解非线性无约束极值问题, 通过范数极小化推导出共扼梯度法的 一般算法。通过对模拟数据和实际工件断层扫描数据进行图像重建, 估计了算法的有效性, 结果表明, 与最速下降法相比, 此算法更适用于不完全投影数据的图像重建, 在保证重建图像拟合度的同时, 大大提高了重建速度。-Image reconstruction has often been transformed into solving nonlinear unconstrained extremum problem,
catleman
- Castleman的数字图像处理。是数字图像处理理论与实践相结合的成功之作，强调理论用于解决工业或科学研究中常见的实际问题。-Castleman s digital image processing. Are digital image processing theory and practice for success, emphasizing the theory for solving the problem of industrial or scientific research in
vshcluster
- 采用VSH算法思想解决p-median问题,别人的东东，希望对大家有所帮助-solving p-median problem by using VSH
circlepacking
- 拟人策略与求解圆形PACKING问题的拟物拟人算法-Personification strategies for solving the problem round PACKING algorithm for quasi-physical personification
build-f
- 求解图形轮廓问题，利用分治算法减少时间复杂度。数据结构以链表为主-Graphic outline for solving the problem, using divide and conquer algorithm to reduce the time complexity. Data structures to the main list
pachking_initial-configuration
- 求解圆形packing问题里面的初始格局：要确定初始格局，也就是要把所有的圆饼随机的放在圆盘内，也就是圆饼的圆心坐标要随机的出现，可以用一个0到1的随机数乘圆饼的半径再乘一个判断随机数的数作为圆饼的x或者y的坐标，这样就保证了圆饼的圆心有可能出现在圆盘内的任何位置-Solving the problem inside the initial circle packing structure: To determine the initial structure, that is, to put
pso1
- 某些实际问题的优化目标是求所有的局部最优解, 即求解多峰寻优问题, 为了求解多峰优化问题, 提出了改造的微粒 群优化算法. 尽量减少微粒群算法中的全局因素, 从而增大其局部因素, 同时采用变步长方法增加微粒的多样性. 并给出了该算法 的原理和步骤. 仿真实验表明该算法概念清楚, 计算简单, 具有很好的局部寻优特性, 可应用求解于多峰寻优问题. 另外还给出了几 个运算实例和与其它优化算法的比较.-Some of the practical problems the optimizati
VTK-FAQ
- vtk常规问题解决方法的汇总，一般问题都会提及-vtk summary of conventional problem-solving method, the general problem will be referred to
YALL1-v1.3
- 求解L1范数最小化问题的凸优化工具包，共含有6个模型的求解方法-Solving the L1-norm minimization problem of convex optimization toolkit contains a total of six methods of solving the model
iteration
- 各种迭代法 迭代法也称辗转法，是一种不断用变量的旧值递推新值的过程,跟迭代法相对应的是直接法（或者称为一次解法），即一次性解决问题。-Iterative method of iterative method, also known as removed, is a constant with the value of the variable' s old value of the new recursive process, with the corresponding itera
Tabu--search--for--graph-
- 用禁忌搜索方法求解图分割问题，大师级人物Fred Glover写的文章，是禁忌搜索的一个典型应用。里面给出了禁忌搜索的流程，算例的结果是与Simulated annealing和Kernighan-Lin s heuristic两种方法进行比较-develop a tabu search procedure for solving the uniform graph partitioning problem
SuperResolution
- This project is a simple implementation of the Iterative Back-Projection (IBP) algorithm for solving the Super-Resolution problem. It was first proposed by Michal Irani in her 1991 paper "Improving resolution by image registration". The imagi
icp-summarize
- 三维点集配准问题是计算机技术中的一个极其重要的问题，作为解决三维点集配准问题的一个应用较为广泛的算法，ICP算法得到了研究者的关注，本文以一种全新的思路从配准元素的选择、配准策略的确定和误差函数的求解等3个方面对三维点集配准的ICP算法的各种改进和优化进行了分类和总结。-3D point set registration problem is an extremely important problem in computer technology, is widely used as an a
migongqiujiewenti
- 介绍一种迷宫问题求解的方法，需要的可以下载下来-Introduces a maze problem solving methods, can be downloaded and see
mcmc
- 基于马尔科夫链蒙特卡尔算法的工具箱，适用于数值分析，矩阵变换，目标检测等系列问题解决的实例，有详细的代码辅助说明。-Based on Markov chain Monte Carl algorithm toolbox for numerical analysis, matrix transformations, target detection and other examples of problem solving, a detailed code help.
123
- 实现图像的边缘检测以及图像复原和运动模糊。解决直方图均衡化问题-Achieve image edge detection and image restoration and motion blur. Histogram equalization problem solving
DenseGreedyDetection
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的仅是在某种意义上的局部最优解。贪心算法不是对所有问题都能得到整体最优解，但对范围相当广泛的许多问题他能产生整体最优解或者是整体最优解的近似解。-Greedy algorithm (also known as the greedy algorithm) refers to when to problem solving, always seems to be made in t
PSOGA
- 求解多维无约束优化问题,收敛性强，还可以加入变异算子-Multidimensional problem solving unconstrained optimization, convergence and strong, you can also join the mutation operator
itkinstall
- 使用itk编程实例详解图解及问题解决，包括.h头文件找不到等问题的解决-Detailed programming examples solved using itk illustrations and problem solving, including the .h header files can not be found and other issues
碎纸片还原MATLAB实现
- 基于碎纸片拼接问题的TSP求解算法，适用于2013年国赛题(Chip stitching algorithm, TSP problem solving)