搜索资源列表
code
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-sheet for the storage structure, to achieve connected undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, r
A_barycenter_based_fast_thinning_algorithm
- 分析快速细化算法和 OPTA 细化算法不足产生的内在原因 ,提出一种新的基于重心的快速细化算法.该算 法根据被细化图像的特点 ,用密度重心快速将纹线细化到 3 个像素宽度内 ,计算 4 邻域拓扑实现彻底细化.仿真结 果表明 ,在细化效率方面 ,该算法一次遍历删除超过一半的大量冗余像素 ,是快速细化算法的 3～7 倍 在细化要求 方面 ,该算法可达到绝对单像素、 光滑无毛刺 ,并能保持端点不被吞噬 ,能够很好地满足图像细化的要求. -The int rinsic origin of
On-the-Removal-of-Shadows-From-Images
- This paper is concerned with the derivation of a progression of shadow-free image representations. First we show that adopting certain assumptions about lights and cameras leads to a 1-d, grey-scale image representation which is illuminant inva
Removing-Shadows-from-Images
- For this project, the shadow removal method used by Finlayson et al. in [1] was implemented. This report contains an overview of the mathematical background and a detailed discussion on the experiments performed with the implementation. This me
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve
Vertical-Edges-based-Car-License-Plate-De
- PDF document for APLR