搜索资源列表
ab
- 根据在十字路口实际情况及车辆闯红灯的特点,本文提出了一种车辆检测算法,该算法是基于首先在检测区域检测到移动车辆然后通过处理进一步分析车辆运动的趋势。-According to the practice of crossroads and the characteristics of vehicles running red-light, this paper presents a vision vehicle detection algorithm based on detection
rbtree_and_sort
- 红黑树和经典的排序算法实现,排序算法包括希尔排序、快速排序、桶排序、归并排序、堆排序、选择排序、冒泡排序等,还有对应的实验报告-Red-black tree and classic sorting algorithms, sorting algorithms, including the Hill sort, quick sort, bucket sort, merge sort, heap sort, selection sort, bubble sort, as well as the co
Circle
- 自己用MFC实现的Bresenham画圆的算法,和MFC画得一样圆。可直接运行Release目录下的执行程序看效果。自己画的红色圆与MFC画的黑色圆是重合的。可作为学习图形编程的好例子。-Bresenham circle algorithm with MFC and MFC painted circle. Implementation procedures in the Release directory can be run directly to see results. The black
boundaryFill4
- opengl图形编程,边界填充算法,采用4-连通递归填充算法,将三角形内部填充为红色。-opengl graphics programming, boundary fill algorithm, 4- connectivity recursive fill algorithm to fill inside the triangle is red.
RedBlackTree
- 红黑树 数据结构与算法分析 in C 书中的算法-Red-black tree Data Structure And Algorithm Analysis In C
display-keypoints-in-SIFT
- 这是SIFT算法的一部分 作用是可以显示图像的极值点并用红色“x”标出,用到opencv gsl库 可以成功运行-SIFT algorithm is part of the role is to show the extreme point of the image and are marked with a red " x" can run successfully used opencv gsl library
classicRecursion
- C++经典递归求值算法题解答,包括逆波兰前缀四则表达式递归求值,红与黑回溯算法,以及分苹果问题-C++ classic recursive evaluation algorithm questions answered, including four expression recursive evaluation Reverse Polish prefix, red and black backtracking algorithm, as well as sub-Apple
pro
- 游戏奖池计算,非常重要的算法哦。 如果概率是5 ,也就是说100个编号1-100的球,其中有5个编号对应的是红色,其余对应的白色,那么任选一个编号,为红的概率是5 。-Game prize pool, very important algorithms Oh. ' If the probability is 5 , that is 100 No. 1-100 balls, including five numbers correspond to the red, the rest of t
TrainLamp2013
- 1) PC软件系统架构:摄像机+USB图像采集卡+PC电脑+RS485模块 2) 嵌入式系统架构: 摄像机+嵌入式系统平台 3) 火车速度<=40KM/H 4) 实现轨道左侧的信号灯颜色检测,红,白,蓝三色 5) PC软件接收RS485的信号进行相应的显示并通过485发送当前信号灯颜色 6) 嵌入式系统接收RS485的信号进行相应的显示并通过485发送当前信号灯颜色 7) 测试环境:雨、雾、冰雪等天气的白天和夜晚环境下 目前在PC上进行了初步的算法实验,演示视频
red_black-Tree
- 红黑树的源码实现,内涵红黑树各项操作算法详解,仅供参考-red-black Tree
GrabCut
- 实施GRABCUT源代码 由贾斯汀塔尔博特jtalbot@stanford.edu 。 放置在公共领域, 2010年 代码最后更新:2006年 弗拉基米尔·洛夫( vnk@cs.cornell.edu ) , 2001年使用GRAPHCUT实施。 要求: OpenGL的, GLUT和OpenCV的库来编译和运行。 用法: grabcut.exe <ppm文件名 使用鼠标拖动矩形围绕前景部分显示的图像。 然后使用下面的按键
hongheishu
- 红黑树C++的实现,算法比较简单,供学习算法的大二学生参考-Red-black tree C++ implementation of the algorithm is relatively simple, for learning algorithm sophomore reference
findpt
- VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 -The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is
GrabCut
- GrabCut实现源代码 贾斯廷·塔尔博特,jtalbot@stanford.edu 放置在公共领域,2010 代码最后更新,2006 使用Graphcut实现弗拉基米尔• 柯尔莫哥洛夫(vnk@cs.cornell.edu),2001。 要求:OpenGL,供过于求,OpenCV库来编译和运行。 用法:grabcut。 exe < ppm文件名> 使用鼠标拖动矩形在前台部分的显示图像。 然后使用以下键 1 :显示图像 “2”:显示
AdaBoost
- 文章主要介绍了AdaBoost算法的理论分析及在其映红。-This article mainly introduces the theoretical analysis and AdaBoost algorithm in its shiny red.
yiqunsaunfa
- 一个很红的边缘检测算法,蚁群识别的,对图像的边缘检测很有用-A very red edge detection algorithm, ant colony identification, the image is useful
shortest-path
- 该程序基于Floyd算法实现最短路径寻优,这里仅是在小规模节点数情况下进行演示。最短路径用红线标出,点击最短路径上某个节点(即该节点出现故障),程序会自动更新最短路径。-The program is based on Floyd shortest path algorithm optimization, where only a small number of nodes in a presentation case. Shortest path marked with red, click o
BallGame
- java编写的 随机产生 双色球 //双色球号码,形如:24,09,11,17,10,07,06 /*算法:红球是编码1-33,蓝球编码是:1-16 从红球中取出六个号码不想等的球,再从篮球中取出一个,组成7个号码。*/-java prepared randomly generated color ball// two color numbers like this: 24,09,11,17,10,07,06 /* algorithm: the red ball is coded 1
baiduvote
- Baidu百度红包验证码分析,基于DES等多种基于算法破解的方式识别百度红包验证码-Baidu Baidu verification code red envelope analysis, based on the DES and other ways to crack identification algorithm-based Baidu verification code red envelope
Peg-solitaire-CppBFS
- Peg solitaire is a classical puzzle commonly played on a 33-hole cross-shaped board (also called "the English Board") or a 15-hole triangular board. A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and