搜索资源列表
inpoly
- This code is described in \"Computational Geometry in C\" (Second Edition), Chapter 7. It is not written to be comprehensible without the explanation in that book. This program reads a polygon P followed by query points from stdin. The in
TextureLBP
- LBP纹理特征提取算法。首先将检测窗口划分为16×16的小区域(cell),对于每个cell中的一个像素,将其环形邻域内的8个点(也可以是环形邻域多个点,如图 3‑ 4. 应用LBP算法的三个邻域示例所示)进行顺时针或逆时针的比较,如果中心像素值比该邻点大,则将邻点赋值为1,否则赋值为0,这样每个点都会获得一个8位二进制数(通常转换为十进制数)。然后计算每个cell的直方图,即每个数字(假定是十进制数)出现的频率(也就是一个关于每一个像素点是否比邻域内点大的一个二进制序列进行统计),然
ScanLineSeedFill
- 4连通内点定义区域的scan line seed fill algorithm-4-connected region interior-point definition of scan line seed fill algorithm
room
- 掌握透视投影与平行投影的基本原理 掌握OpenGl的投影变换的基本方法 设计并实现一个室内场景造型 交互式方式实现室内场景浏览功能 设计视点运动轨迹 -Perspective projection and parallel projection master the basic principles of OpenGl projection master the basic method of transformation Design and implement
example3
- 三维Sierpinski镂垫的递归程序,使用三维点,由于每个四面体都是凸性的,因此四面体的顶点与其内部任意点肯定在四面体内部-3D Sierpinski router pad of the recursive procedure, using a three-dimensional point, because each tetrahedron is convex, so the tetrahedral vertex and any point must be in the tetrahedra
Prosac
- 用opencv2.3.1+vs2008实现PROSAC算法。PROSAC是比ransac算法更快的剔除无匹配算法。前提是,这种策略的前提是假定匹配度高的特征是内点的概率比匹配度低的特征要高。 -With opencv2.3.1+ vs2008 realize PROSAC algorithm. PROSAC is faster than ransac algorithm of eliminate no matching algorithms. Premise is, this strategy
Contour-extraction
- 轮廓提取的目的就是获得图像的外部特征,是进行图像分析的有用手段之一.二值图像轮廓提取的算法非常简单,就是掏空内部点:如果原图中有一点为黑,且它的8个相临点都是黑色时,则将该黑点删掉-Contour extraction is to obtain the purpose of the external characteristics of the image, is useful for image analysis means of the binary image contour extrac
86789654
- D F P变尺度法子程序 matlab程序 Powell法子程序 内点惩罚函数法子程序-D F P variable-dimension way program matlab Powell way program interior point penalty function way