vc-driven-camera-capture-images

亚像素方面的相关源码!!!相信对你的学习会有帮助!(Related to source sub-pixel area!!! That would be helpful to your learning!)

集成ITK、VTK、MFC读取DICOM的代码，建成win32程序即可。运行完美(Integrated ITK, VTK, MFC to read DICOM code, built win32 program can. Works perfect)

基于efficient subwindow search算法的windows实现(efficient subwindow search for windows )

EDLines是一种快速直线检测算子，2012年在ICCV上提出，也是目前处理直线检测最快的算法之一，该算法包含三个步骤：（1）边缘提取：利用Edge Drawing (ED)算法[28,29]从灰度图像中提取边缘片段；（2）线段检测：利用最小二乘法提取直线段；（3）线段确认：遵循Helmholtz定律，从已提取的直线段中摒弃虚假线段。EDLines算法的优越性得益于Edge Drawing (ED)算法能够从灰度图像中准确、快速、稳定地提取出光滑、完整的边缘片段。Edge Drawing (ED)算法包含以下步骤： （1）采用size=5*5,σ=1的高斯核对灰度图像进行平滑滤波，去除噪声； （2）采用一种常用的梯度算子，如Prewitt、Sobel或Scharr等计算平滑后图像中每个像素点的梯度幅度和梯度方向； （3）将梯度图中邻域内幅度最大的像素点标记为锚点，这些锚点成为图像边缘点(edge elements)的概率很大； （4）将相邻的锚点连接成边缘线。从一个锚点起始，ED利用相邻像素的梯度幅度和方向在梯度为最大值的锚点之间游走。 (Edge Drawing (ED) is our recently-proposed, novel, fast edge detection algorithm. What makes ED stand out the existing edge detectors, e.g., Canny, is the following: While the other edge detectors give out a binary edge image as output, where the etected edge pixels are usually independent, discontinuous entities ED produces a set of edge segments, which are clean, contiguous, i.e., connected, chains of edge pixels. Thus, while the output of the other edge detectors requires urther processing to generate potential object boundaries, which may not even be possible or result in inaccuracies ED not only produces perfectly connected object boundaries by default, but it also achieves this in blazing speed compared to other edge detector.)

c++编写的一个简单的类似Photoshop的图像编辑系统(c++ written in a simple system similar to the Photoshop image editing)

编程实现大津（Otsu）自动灰度阈值分割算法的程序(Programming (Otsu) automatic gray Otsu threshold segmentation algorithm)

经典的文本水印算法，实现了别人实现不了的功能，希望大家有所用！(The classic text watermarking algorithm to achieve the functions of others fail to realize, I hope you all have a use!)

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

说明：  自由曲面光学透镜的图像变换面形测量系统与精度建模(Free-form optical lens image transformation shape measurement system with precision modeling)

基于OPENCV的SIFT特征提取与匹配算法。包含完整的从图像高斯金字塔、DOG、空间极值点提取、关键点描述、KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助。程序运行前须安装（1）OpenCV: http://opencvlibrary.sourceforge.net （2）SIFT: http://web.engr.oregonstate.edu/~hess/index.html，并配置其环境参数。(OPENCV the SIFT-based feature extraction and matching algorithm. Contains a complete Gaussian pyramid from the image, DOG, space extremum point extraction, description of key points, KDtree matching key step in the realization of the full function of the comprehensive and in-depth understanding of Lowe s SIFT algorithm of tremendous help. Program to run before the installation of (1) OpenCV: http://opencvlibrary.sourceforge.net (2) SIFT: http://web.engr.oregonstate.edu/ ~ hess/index.html, and configure the parameters of their environment.)