-
fish_full
实现鱼眼图 圆形视场和全视场的校正、分为2幅图像、4幅图像、任意角度、任意位置的校正、全景图拼接等(Fish eye diagram of a circular field of view and full field calibration is divided into two images, four images at any angle, any position of the correction, and panoramic stitching.)
- 2012-07-11 11:01:10下载
- 积分：1
-
Visual+C++Picture
说明： 该书介绍的用VC实现图像处理，其中包括一些图像处理知识的介绍(The book described the realization of image processing using VC, including some knowledge of image processing introduction)
- 2008-11-29 14:47:35下载
- 积分：1
-
calibration_for_camera
单目相机标定，非常好用，可在visual studio以及visual C++上运行(calibration for camera)
- 2015-07-27 09:19:33下载
- 积分：1
-
Matrix
说明： 求矩阵的特征值和特征向量，使用c语言编程(Matrix eigenvalues and eigenvectors, c language programming)
- 2011-03-07 12:51:59下载
- 积分：1
-
jpeg_C_orign
jpeg编码工程(YUV2RGB)
文件中含有说明文件,保证可以使用(jpeg encoding works (YUV2RGB) file contains the documentation to ensure that you can use)
- 2007-11-15 20:43:30下载
- 积分：1
-
CCD-
采用National Instruments 视觉算法库，雷赛运动控制卡，映美精相机 检测手机LOG(Using National Instruments vision algorithms library, Lemire motion control card, Imaging camera detects the phone LOG)
- 2015-03-25 14:49:56下载
- 积分：1
-
src
读取RAW格式文件，将其转换为BMP格式文件并存储(raw 2 bmp file format convert)
- 2016-04-20 16:29:22下载
- 积分：1
-
algorithm-of-findpath
绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区
域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行
定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解
决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻
接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每
个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(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)
- 2012-12-09 23:26:22下载
- 积分：1
-
Max-Points-on-a-Line
给定的n个点在二维平面上,发现的最大数量点躺在同一直线。(Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
)
- 2016-03-27 19:10:38下载
- 积分：1
-
DebugDemo
设置位置断点跟踪程序，VC++精选编程源码，很好的参考资料。(Set breakpoint location tracking procedures, VC++ programming source code, a good reference.)
- 2013-11-26 09:57:15下载
- 积分：1
