搜索资源列表
greedy_snake
- 图像分割常用的主动轮廓模型中的一个经典算法——贪心算法-image segmentation commonly used active contour model of a classical algorithm -- greedy algorithm
DuoBianXingYOUXIJava
- 本代码为王晓东算法书上的多边形代码贪心算法实现-code for the algorithm Wang Xiaodong book on the polygon code greedy algorithm
greedy
- 集装箱的装箱问题: *给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材 *的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装 *箱的空间利用率最高？使用贪心算法解决。 *编译方法：打开cpp文件，在编译的同时建立工程,打开 \"settings->link\" *在link项的Object/library modules:中加入Opengl32.lib glu32.lib glaux.lib
greedy
- active contour算法中的经典算法：greedy算法文献
Image-Segmentation
- 一个基于图形的高效图像分割算法，包括论文及相应的源代码。-This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develo
GVF_Snake
- GVFSnake算法相对好实现，且有相关的例子说明，代码中对各部分内容做了详细的说明，和Greedy算法相比，该算法具有很好的实用性-GVFSnake algorithm to achieve relatively good, and relevant examples, the code for each part of a detailed descr iption, and the Greedy algorithm, the algorithm has a good practical
sparsify_0_3
- sparsify is a set of Matlab m-files implementing a range of different algorithms to calculate sparse signal approximations. Currently sparsify contains two main sets of algorithms, greedy methods (collected under the name of GreedLab) and hard thresh
ride
- Greedy Gift Givers USACO
Demo_Relaxation
- 《Sparse and Redundant Representations From Theory to Applications in Signal and Image Processing》中贪婪算法中的松弛算法的演示程序，包括算法本身与处理效果-Sparse and Redundant Representations From Theory to Applications in Signal and Image Processing in the relaxation algorithm
improve
- 通过走向原始数据改进数据锐化方法，利用迭代贪婪算法快速实施-IMPROVE A DATA SHARPENING SOLUTION BY MOVING IT TOWARD THE ORIGINAL DATA,QUICK IMPLEMENTATION OF THE ITERATED GREEDY ALGORITHM
greedy-algorithm
- 这是基于Donna Williams和Mubabak Shah的贪婪算法论文的代码-This code is based on the greedy algorithm which presented by Donna Williams and Mubabak Shah in their paper
map-cloering
- 利用贪心算法对中华人民共和国地图进行着色，就是著名的四色问题。-Use a greedy algorithm to the people s Republic of China for coloring, is the famous four-color problem.
lectures-about-CS-and-SpaRec
- 一些关于压缩传感的基础性、系统性的介绍和一些稀疏信号重构算法的介绍如FOCUSS和Greedy Algorithm,适合入门人学习的资料-Some basis and system lectures about compressive sensing also including some sparse signal reconstruction algorithm for you such as FOCUSS and Greedy MP.all the materials are fit fo
SnakeTest
- 采用贪心算法对Snake进行实现，能够分割出图像的边缘。-Greedy algorithm to achieve the Snake, and be able to split the edge of the image.
(code)Greedy-Algorithms
- 贪心算法的文档资料和具体的代码实现，不错的资源偶-Greedy algorithm documentation and code implementation, good resource even
segment
- We de¯ ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an e±cient segmentation algorithm based on this predicate, and show that although this algo
MP
- 稀疏表示中的一种重构算法，贪婪算法，通过逼近来寻找局部最优解-Sparse representation of a reconstruction algorithm, greedy algorithm, by approaching to find a local optimal solution
COSAMP
- 压缩感知中重构算法，压缩采样匹配追踪算法，它属于贪婪算法，效果相对于MP,OMP 要优越-Compressed sensing reconstruction algorithm, compressive sampling matching pursuit algorithm, it belongs to the greedy algorithm, the effect relative to the MP, OMP superior to
Greedy
- 迭代蛇模型，包含GUI界面 可以绘制每次点的变化 也可以直接得到结果-Greedy Algorithms Active contour
Greedy-Snake
- Greedy sanke algorithm implements-贪婪蛇算法的实现，该算法是对原Donna J. Williams 《A fast algorithm for active contours》 （1990） 论文的简化实现。对算法研究很有帮助。参数很多，需要调节才能获得良好的效果。