基函数的导数

knn k近邻算法，可选择欧式距离或者曼哈顿距离-knn k nearest neighbor, Euclidean distance or Manhattan can choose the distance

数字图像的边缘检测是图像分割、目标识别、区域形状提取等图像分析领域 十分重要的基础。在进行图像理解和分析时，第一步往往都是边缘检测。目前， 边缘检测已成为机器视觉研究领域最活跃的课题之一，其研究具有非常重要的理 论意义和实际应用价值。传统的边缘检测方法的检测精度最高只能达到一个像素 级，但是，随着科学技术的飞速发展，工业检测等应用对精确度的要求不断提高， 传统的像素级边缘检测方法已经不能满足实际测量的需要，因此需要更高精度的 边缘检测方法，即亚像素边缘检测方法。本文针对亚像素边缘检测技术进行了深 入研究，研究内容主要包括以下几个方面：

基于ev533开发板的视频采集，经认证绝对好用。-Ev533 development board based on the video capture, the absolute ease of use by the certification.

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

基于delphi的可视化编程

小波变换，小波变换函数，非常有用,适合任何读者-Wavelet transform, wavelet transform function is very useful

徐堵哥流苏形象勾不过K线板，为进攻挡得住别有用心的别有用心！

一个C编写的多边昆虫- A C compilation multilateral insect

VC编写的图象打开与显示程序-VC prepared to open the image and display procedures

反走样 Line.rar-Anti-aliasing Line.rar