搜索资源列表
Bresenham高效画线算法
- 画线的算法不少，但要作到高速、简单并不容易。斜率相乘法是最简单的方法之一，但计算每个点均要花费不少时间用于乘、除法运算；下面介绍的是Bresenham s高效画线算法，对每个点的坐标计算只要加、减法就能完成。-line drawing algorithm, but a lot to be done fast, simple is not easy. The slope is the most simple multiplication is one of the ways, but each p
ImageFFT2
- VC编写的高效的图象2D快速傅立叶正变换程序,编译通过.适合256色bmp图象变换.效果和matlab的fft2()没法比,但是程序值得借鉴.适合图象处理初学者,有助于理解傅立叶变换在图象处理中的重要作用.-VC efficient preparation of the image is 2D fast Fourier transform procedures compile. Bmp for 256-color image transformation. Results and Matlab
AFMM_Inpainting
- 基于快进算法的破损图像修复算法，只要将图像中的破损区域由纯红色标出，该算法即可自动完成对该区域的修复。要求修复图像格式为BMP格式。-algorithm based on fast forward damaged the image restoration algorithms, as long as the image of the region damaged by the pure red mark, The algorithm can automatically complete res
matlab_toolbox_fast_marching
- 水平集（level set）中快进算法（fast marching）算法的matlab工具箱，内容很全面。-Level Set (level set), Fast Forward algorithm (fast marching) algorithm m atlab Toolbox, which is very comprehensive.
HUandradon
- 用于计算HU 的7个不变矩和RADON的2、3阶不变矩。网站中有C++写的RADON变换，但西北工业大学的一名教授使用RADON变换构建了这种新型的不变距，可以降低图象的维数，计算速度较快。算法详情可参考他的文献。-used in the calculation of the seven RADON unchanged moments and the 2,3-order moment invariants. Web site is written in C RADON transform, bu
FasteffectiveDCT
- DCT变换是数字图像处理中重要的变换，很多重要的图像算法、图像应用都是基于DCT变换的，如JPEG图像编码方式。对于大尺寸的二维数值矩阵，倘若采用普通的DCT变换来进行，其所花费的时间将是让人难以忍受甚至无法达到实用。而要克服这一难点，DCT变换的快速算法无非是非常吸引人的-DCT digital image processing is an important transformation, many important images algorithm, imaging applicatio
2DDCT
- 实现快速离散余弦变换的C代码。用在2 维图形压缩处理的预先处理-fast discrete cosine transform C code. Using the two-dimensional graphics compression pre-treatment
h2ha
- matlab开发环境下的图像分割，效果好。分割快-Matlab development environment of image segmentation, good effect. Segmentation fast!
ellipse_arc
- 绘制椭圆弧，这个算法讲究快速、效率高，特别是逼近椭圆弧的直线个数较少-drawn ellipse, the algorithm stresses fast, high efficiency, in particular approximation ellipse line number less
imagetransformationbymatlab
- 1.图像频域处理正交变换的matlab实例 2.含有的频域变换内容如下： 正交变换通用算子 傅立叶变换 傅立叶变换的原理 傅立叶性质 二维离散傅立叶变换（ 2DDFT ） 快速傅立叶变换（ FFT ） 傅立叶变换的研究与应用 离散余弦变换 DCT 变换矩阵 dct2 函数和 dctmtx 函数 Walsh- Hadamard 变换 Radon 变换 -1. Image processing orthogonal freq
hjldwg
- 一个快速读写DWG的文件源代码，DWG是矢量开发中经常碰到的文件格式，DWG文件格式比较烦琐，此库为程序员读写DWG文件节省很多精力-a fast read and write DWG document source code, Vector DWG development is frequently encountered in the paper format, DWG file format, and more than that, for this to read and write D
CurveLab
- 曲线快速匹配matlab程序，功能全面包括FMM迭代，曲率匹配，炼码计算等，非常适用。推荐！-curve fast matching Matlab procedures, including the full functions of FMM iteration, curvature matching, Lian dollar terms, very well. Recommended!
Fast_Global_Minimization_Active_Contour
- Author: Xavier Bresson (％ Last version: Aug 3, 2008 ％ For more information: X. Bresson and T.F. Chan, \"Fast Minimization of the Vectorial Total Variation Norm and Applications to Color Image Processing\", CAM Report 07-25
Fast_Color_Denoising_ROF
- Name: gmac = global minimization of the active contour model ％ Descr iption: see paper \"Fast Global Minimization of the Active Contour/Snake Model\" in JMIV07 ％ Author: Xavier Bresson (xbresson@math.ucla.edu) ％ Lastest version: 07-09-21
FastGraphicsFilters
- +--- --- --- --- ----+ | Graphics Filters v2001.08 | | by Manuel Augusto Santos | | If you use this in your applications, please | | include my name in the about box | +----------------------------------------------+ | Shows how to perfo
toolbox_fast_marching
- The goals of this tool is to manipulate the fast marching algorithm in 2D and 3D. Application to shortest path extraction (e.g. road tracking and tubular structure extraction in medical images), shape statistics and geodesic remeshing are presented.
20040224_ME_Programs
- Fast Block Matching Motion Estimation Algorithms Source Code
Fast-Noiselet-Transform
- Fast Noiselet Transform
Fast-Walsh-Hadamard-Transform
- Fast Walsh-Hadamard Transform
Fast-a-Robust-Super-Resolution(BTV)
- 快速超分变率重建，基于TV的基础上进行BTV编程，鲁棒性良好。时间，空间上都很不错算法-Super-fast variability reconstruction, carried out on the basis of TV program on BTV, robustness is good. Time and space are very good algorithm