搜索资源列表
方便的小波变换原代码
- 小波变换源代码 wav_basic.c: basic filtering, decimation and upsampling routines. wav_basic.h: interface to wav_basic.c. wav_trf.c: transform routines. wav_trf.h: interface to wav_trf.c. wav_filters.h: where filter banks and their properties are de
Ilib-1.1.8-min
- IPL库是Intel为了配合其MMX,SSE,SSE2以及将来的VLSW等技术发布的图像处理库 支持1,8,16,位有/无符号，32位有符号，32位浮点类型数据类型。 支持RGB,CMYK,YCACB,YUV,XYZ,色彩空间，支持alpha通道 支持矩形ROI,通道ROI，遮罩 支持分块图像，错误处理，用户定义函数 支持图像数学，几何，滤波，图象统计，色彩空间变换操作。-IPL is the database to accommodate its Intel MMX, SS
minimalScreenSaver
- This class loads a texture file and prepares it to be used in OpenGL. It can open a bitmap or a targa file. The min filter is set to mipmap b/c they look better and the performance cost on modern video cards in negligible. -This class loads a fi
xbbhydm
- wav_basic.c: basic filtering, decimation and upsampling routines. wav_basic.h: interface to wav_basic.c. wav_trf.c: transform routines. wav_trf.h: interface to wav_trf.c. wav_filters.h: where filter banks and their properties are de
1EC959ED
- 抗几何攻击的盲数字水印技术耿敏，李恩平，梁华庆(中国石油大学电子信息工程系，北京102249)摘要：数字水印技术是解决数字作品版权保护的一个重要手段。衡量数字水印技术可靠性的标准是能否抵抗各种水印攻击，而几何攻击是目前困扰数字水印领域发展的突出问题，数字水印多采用盲水印算法。总结了当前抗几何攻击的各种盲水印方法，并对今后的研究方向进行了探讨。-Blind digital watermarking technology Min, Li Yun Ping, Liang Hua (China Univ
ESegment
- 程序功能为将bmp彩色图片中的背景去除，留下图片的主要内容。该程序采用graph-based的图像分割算法，分割效果良好。 在命令行下通过传递参数运行：ESegment sigma k min input output 其中：ESegment为编译得到的程序名； sigma为平滑系数，一般取0.5～2之间的值； k一般取图片长、宽（像素）之间的值； min表示分割出的最小块的大小，取正整数即可 input为输入的bmp图片名 output为输出的bmp图片名-proc
GCv2p1
- GC_optimization - software for energy minimization with graph cuts Version 2.0 http://www.csd.uwo.ca/faculty/olga/software.html-GC_optimization-software for energy min imization with graph cuts Version 2.0 http : / / www.csd.uwo.ca / faculty / olga /
analyze_values
- purpose computes histogram and some statistical measures (min, max, ...) for a list of values (one per line) compile gcc -g -o analyze_values analyze_values.c -lm -purpose computes histogram and some stati stical measures (min, max, ...) for
H_MM_0124_02
- min-min,max-min,H-mm新算法
max_min_filter
- 在图像利用M*N的窗 运行2维最大滤波器 在图像利用M*N的窗 运行2维最小滤波器 -performs two-dimensional maximum filtering on the image X using an M-by-N window. performs the 1D max/min filtering of the row vector X using a N-length filter. performs two-dimensional minimum filtering
MinMaxFilterFolder
- Min/Max filter，最大最小滤波器，说明看英文，只是国外的人写的代码， -Descr iption The filter computes the minima and/or maxima of an array over sliding window with a given size. Multidimensional array is fully supported: running filter in 1D, 2D filter for image process
newmaxflowaigorithm
- 实现了An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision [Yuri Boykov and Vladimir Kolmogorov]中的新的最大流算法，经过实验验证比传统的最大流算法效率更高-Achieved An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Mini
original_GraphCut
- An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
MaxFlowcpp
- max flow min cut in c++ code
adjgamma
- 图像预处理-图像去噪方面-滤波器-matlab的实现程序，非常清晰- ADJGAMMA- Adjusts image gamma. function g = adjgamma(im, g) Arguments: im - image to be processed. g - image gamma value. Values in the r
localHistCal
- 实现了局部直方图的均衡，在一副图像的矩形窗中实现直方图均衡，像素均衡范围为(min,max),分别代表矩形块的最大最小像素数。-The local histogram equalization in a rectangular window to achieve the image histogram equalization, balanced range of pixels (min, max), representing the minimum and maximum rectangula
graph-based-image-segmentation
- 五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperi
min
- sift算法中特征点提取时，极小值的提取。-sift min
denoisingFilters
- denoising filters such as Average, Median, Gaussian, Wiener, Min-order-statistic, Maxorder-statistic and Median-order-statistic are used. Based on the images obtained by the mentioned filters, it is become obvious clear that for the given noisy im
max-flow-min-cut
- max-flow/min-cut algo