ostu

一幅大小为256×256的256级灰度图像（每像素8bit） 如果图像的各个像素之间是统计独立的，求该图像的信息熵 -离散无记忆信源 如果图像的各个像素之间不是统计独立的，求该图像的信息熵 -图像像素的概率分布模型(A 256 gray scale image (8bit per pixel) with a size of 256 x 256 If each pixel of the image is statistically independent, the information entropy of the image is calculated Discrete memoryless source If each pixel of the image is not statistically independent, the information entropy of the image is calculated Probability distribution model of image pixels)

程序可以实现BMP图片特效处理,包括浮雕效果(bmp picture)

著名专家写的计算机视觉方面的原著，希望对大家有所帮助(Writing a well-known experts in the computer vision aspects of the original, and they hope to help everyone)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)

本程序和实现对一幅包含人脸的bmp图像进行光纤补偿，对人脸区域进行检测实现人眼和人嘴的检测与定位，最后勾绘出人脸的特征以实现人脸检测的目的。(This procedure and implementation of a compensate the fiber contains face of BMP image, the face region detection to realize human eyes and mouth detection and positioning, finally drew out the facial features to achieve the purpose of face detection. )

毕业设计，基于内容的图像检索，支持的检索特征包括 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)

说明：  PCL+ MFC+ Visualization 点云显示(PCL+ MFC+ Visualization)

ITK的脑室图像分割,可以对脑部的图像用itk进行分割，用VTK来进行显示。(the segration of brain of ITK )

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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.)

说明：  实现机器视觉双目标定，三维重建等算法，具有很好地擦考价值( Robot with two cameras to switch recognition system. (Note that not binocular vision) and the reference used opencv1.0 cmv. )