Location:
Search - find edge open
Search list
Description: 基于OPENCV的图象边缘检测,(VC++)
利用canny算法寻找图象边缘并再输出中标志.-OPENCV based on image edge detection, (VC++) Using canny edge algorithm to find the image and re-exported in the symbol.
Platform: |
Size: 106496 |
Author: 朱晨 |
Hits:
Description: open cv source code to find edge
Platform: |
Size: 1024 |
Author: qwertbb |
Hits:
Description: 传说中，南极有一片广阔的冰原，在冰原下藏有史前文明的遗址。整个冰原被横竖划分成了很多个大小相等的方格。在这个冰原上有N个大小不等的矩形冰山，
这些巨大的冰山有着和南极一样古老的历史，每个矩形冰山至少占据一个方格，且其必定完整地占据方格。冰山和冰山之间不会重叠，也不会有边或点相连。
ACM探 险队在经过多年准备之后决定在这个冰原上寻找遗址。根据他们掌握的资料，在这个冰原上一个大小为一格的深洞中，藏有一个由史前人类制作的开关。
而唯一可以 打开这个开关的是一个占据接近一格的可移动的小冰块。显然，在南极是不可能有这样小的独立冰块的，所以这块冰块也一定是史前文明的产物。
他们在想办法把这 个冰块推到洞里去，这样就可以打开一条通往冰原底部的通道，发掘史前文明的秘密。冰块的起始位置与深洞的位置均不和任何冰山相邻。
这个冰原上的冰面和冰山都是完全光滑的，轻轻的推动冰块就可以使这个冰块向前滑行，直到撞到一座冰山就在它的边上停下来。冰块可以穿过冰面上所有没有冰山的区域，
也可以从两座冰山之间穿过。冰块只能沿网格方向推动。-According to legend, there is a vast Antarctic ice sheet, the ice sheet under the possession of the site of prehistoric civilization. If they had the entire ice sheet is divided into many equal-sized squares. N in the ice on the tip of a rectangle of varying sizes,
These huge Antarctic icebergs has and as old as the history of the tip of each of at least occupy a rectangular box, and will fully occupy the square. Do not overlap between the tip of the iceberg and there will not be connected to edge or point.
ACM expedition after the decision, after years of preparation in the ice to find sites. According to their information available in the ice sheet the size of a cell of a deep hole, possession of a prehistoric people made the switch.
The only you can open an account for this switch can be moved close to a grid of small ice cubes. Clearly, in the Antarctic is not possible to have such a small independent ice, so this ice must also be a product of prehistoric civilization.
They
Platform: |
Size: 245760 |
Author: 胡灏 |
Hits:
Description: For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).-For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
Platform: |
Size: 1024 |
Author: yashika |
Hits:
Description: 首先进行边缘检测，然后进行填充。然后进行开运算，可以使一些轻微连着的米粒分开来。然后是遍历图片，把各米粒进行标号，从1开始从小到大标号。每个米粒的各像素点值相同，第i个米粒的各像素点值均为i。其中采用了队列，用数组模拟。最大的米粒标号便是米粒的总个数。最后，遍历一遍图像数组，便可求出各米粒的面积。-First, edge detection, and then filled. Then open computing can make some minor attached rice grains to separate. Then traverse the pictures, label each grain of rice, start from a small to a big label. Each pixel of each rice grain is the same value, each pixel value of the i th groats are i. Which uses a queue array simulation. The total number of the largest grain of rice label is a grain of rice. Finally, traverse again the image array, you can find the area of each grain of rice.
Platform: |
Size: 8192 |
Author: 李大齐 |
Hits: