DecodeString

四叉树分割 opencv 编写 读入灰度图 进行递归分割(Quadtree segmentation opencv read into grayscale prepared for recursive partitioning)

毕业设计，基于内容的图像检索，支持的检索特征包括 sift,颜色直方图，灰度矩阵，HU不变矩，边缘方向直方图，检索方法使用K-means和K-D树两种，需要OPENCV支持，运行时请先选定一个文件夹来生成特征库，特征库用access数据库保存，只支持JPG文件(Graduate design, content-based image retrieval, search features, including support sift, color histogram, gray matrix, HU moment invariants, edge direction histogram, retrieval method using the K-means and KD trees are two kinds of needs OPENCV support Please select a runtime folder to generate the feature library, feature library with access database save, only supports JPG files)

imnoise的M文件，对数字图像的加噪声非常有用处！(imnoise M-files, plus noise on digital images is very useful!)

VB像素光影跟踪（图像渲染）工具,有需要的就下载吧。(VB Tracking pixel lighting (image rendering) tools, there is a need to download it.)

数​ 字​ 图​ 像​ 处​ 理​ 中​ 的​ b​ p​ m​ 图​ 像​ 读​ 取(Digital image processing of the image b p m reading)

vc++ 数字图象处理 很好用我看了以后收益非浅希望大家喜欢(vc digital image processing with very good after I read greatly benefit hope you like)

说明：  本课题的主要内容是图像预处理,它主要从摄像头中获取人脸图像然后进行处理,以便提高定位和识别的准确率.该模块主要包含光线补偿、图像灰度化、高斯平滑、均衡直方图、图像对比度增强，图像预处理模块在整个系统中起着极其关键的作用，图像处理的好坏直接影响着后面的定位和识别工作,内有源代码和全部论文资料(this issue is the major content of image preprocessing, mainly from the camera to obtain images Face then, in order to improve the recognition and positioning accuracy. The module consists mainly of light compensation, Grayhound, Gaussian smoothing, balanced histogram, image contrast enhancement, image pre- processing module in the system plays a crucial role in image processing will have a direct impact behind the positioning and identification, within Active code and all papers information)

能够成功实现傅里叶变换，包括32点 64点 128点 256点 512点 1024点。(Fourier transform can be successfully achieved, including 32 points 64 points 128 points 256 points 512 points 1024 points.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)

比较新的图像处理类，2010版，并且有DEMO,方便应该(Relatively new class of image processing, 2010 Edition, and has DEMO, should facilitate)