人脸识别中的分支―皮肤识别，相当于一个简单的边缘检测系统。用C#实现皮肤识别功能。文件包含源代码。...

基于的图像旋转，实现图像放大缩小的程序，很好用的-Based on the image rotation, zoom image of the process, well used

我们平常玩的飞机射击类游戏，这其实很简单，在加载上图片后，实现精灵类碰撞检测，每按键一次，图片显示相应的动作，真的很简单，希望你能从这个简单的游戏获得启发-To play our usual type of plane shooting games, this is a very simple add-on in the picture, the type of collision detection Elven implementation, each button once, the motion picture shows, really easy, I hope you benefit from this simple game get inspired

适用于256灰度级的位图.直方_线性_平滑_阈值_滤波处理.-apply to the 256-level grayscale bitmap. Direct linear side _ _ _ smoothing threshold _ filtering.

抓取远程ip摄像头图像，然后显示可以直接设置ip地址的位置

dicom格式文件的读取和显示 可以生成安装文件-dicom reader dicom reader dicom reader

经典的水波算法，在背景上加入了，水波折射效果-classical wave algorithm, in the background, joined the wave refraction effects

将真彩位图转化成各色或黑白位图, 1. 将真彩位图转化成各色或黑白位图，进行二值化(支持多种抖动方法)处理后的位图，效果和速度极佳。 2. 将真彩或黑白位图进行 90度 , 180 度 ,270 度 高速度旋转。-The true color bitmap into a colored or black and white bitmap, 1. The true color bitmap into a colored or black and white bitmap to binary (supports multiple dithering methods) treated bitmap, effectiveness and speed of excellent . 2. The true color or black and white bitmap to 90 degrees, 180 degrees, 270-degree high-speed rotation.

Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the

该程序能够实现动态画圆，每隔一段时间画一个填充颜色的圆。-The program can dynamically draw a circle, from time to time to draw a fill color circle.

一个关于高级多线程的源码-a senior multithreading on the source