gauss-noise

基于小波和形态学的自然地面背景红外目标检测方法。。。。。。(Based on wavelet and morphology of the natural terrestrial background infrared target detection method)

Compression of face images impact the performance of face recognition (FR) systems. JPEG Region of Interest (JROI) compression maintains high image quality in facial regions while compressing the background more, with minimal impact on FR performance.(Compression of face images impact the perf ormance of face recognition (FR) systems. JPEG Region of Interest (JROI) compression maintai ns high image quality in facial regions while co mpressing the background more, with minimal impact on FR performance.)

图形的剪裁算法源码，visual c++源码(The graphics cut algorithm source code, visual c++ Source)

说明：  图形处理功能，有滤波功能，边缘提取等各个方面，值得一看(Graphics processing capabilities, has filtering, edge detection and other aspects, see)

直线段检测算法EDLines C++实现(EDLines C++ Opencv lins segment detection)

pca-sift算法的实现，采用vc2008开发环境，进行开发，独立运行(pca-sift algorithm, using vc2008 development environment to develop, operate independently)

多媒体图形图像正交变换语言是VC++,源码正交变换(Multimedia graphic image orthogonal transform language is VC++ source orthogonal transformation)

直方图拉伸是通过对比度拉伸对直方图进行调整，从而“扩大”前景和背景灰度的差别，以达到增强对比度的目的(Histogram stretching histogram is adjusted by contrast stretching, thereby " expand" the difference between the foreground and background of gray, in order to achieve the purpose of enhancing the contrast)

利用visualC++和图像处理的知识，编写程序对果蔬进行自动识别(Using visualC++ and image processing knowledge, write a program for automatic identification of fruits and vegetables)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(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)