资源列表
Delaunay-triangulationJava
- 利用Java实现任意的三角形网格剖分，提高网格质量-Improve the quality of the grid.Using Java to achieve arbitrary triangular mesh division.
SIFT
- SIFT algorithm. to find feature discr iptor. the algorithm returns the locations of key loints and then matches two pictures with htose points.
imagine entropy
- 一个MATLAB写的求图像的信息熵程序，对大家肯定有用(This is is matlab code about imagine entropy)
quzao
- NEIGH SHRINK去噪方法，效果比较好-Neigh shrink denoising method
mapwidget
- 简单的地图显示，具有缩小放大，漫游的-Simple map display with narrow zoom, roaming can
graphDraw4beta6_net
- 一个图形库。包括BAR、XYLine、Scatter、StackedBar、BoxWhisker等图形实现。-a graphics library. Including BAR, XYLine, Scatter, StackedBar. BoxWhisker and other graphics to achieve.
vector_system_programming
- < 矢量图形系统开发与编程>>一书的配套光盘，包括了一个矢量图形系统和一个GIS系统的源码-< < Vector graphics system development and programming> > 1 book matching CD-ROM, including a vector graphics system and a GIS system source code
ENL
- usefull function to calculat ENL in SAR image denoising ,we computed the equivalent number of looks (ENL), a standard parameter widely used in the remote sensing community which measures the speckle reduction in homogeneous areas. with some SAR i
eight
- 八数码问题也称为九宫问题。在3×3的棋盘，摆有八个棋子，每个棋子上标有1至8的某一数字，不同棋子上标的数字不相同。棋盘上还有一个空格，与空格相邻的棋子可以移到空格中。要求解决的问题是：给出一个初始状态和一个目标状态，找出一种从初始转变成目标状态的移动棋子步数最少的移动步骤。所谓问题的一个状态就是棋子在棋盘上的一种摆法。棋子移动后，状态就会发生改变。解八数码问题实际上就是找出从初始状态到达目标状态所经过的一系列中间过渡状态。 八数码问题一般使用搜索法来解。搜索法有广度优先搜索法、深度优先搜索法
TicTac
- VC++ 鼠标点击下棋-VC++ chess play with bottun the mouse./......
heiles
- henonheiles方程的庞加莱截面图,非线性哈密顿方程的典型,保证无误可供参考.-Poincare section henonheiles equation, typical nonlinear Hamiltonian equations, ensure the correct reference.
MLS
- 移动最小二乘图像变形，MATLAB，打开demo2，标定关键点，再标定要变换的位置，-Moving Least Squares image distortion, MATLAB, open demo2, calibration key points, and then calibrated position to transform