Search - connected component algorithm

Search - connected component algorithm - List

[JSP/Java] scc DL : 0: 递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。输出到result.txt中。-recursive algorithm for a directed graph strongly connected component, the input format such as compression package data4.txt. the first acts of the number of vertices. Result.txt exported to China.
Date : 2008-10-13 Size : 6.71kb User : 王军
[GDI-Bitmap] 连通成份分析 DL : 0: Computes "Connected Components" using Tarjan s Union-Find algorithm the result is returned in the same buffer as gray_level image with values equal to the label of the component.
Date : 2025-07-16 Size : 3kb User : 周平
[Special Effects] ConnectedComponentLabeler_v1.0 DL : 0: 该算法为领域标记程序，可以检测 blob 区域-the algorithm for field marking procedures can detect regional blob
Date : 2025-07-16 Size : 7kb User : yixinhua
[JSP/Java] scc DL : 0: 递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。输出到result.txt中。-recursive algorithm for a directed graph strongly connected component, the input format such as compression package data4.txt. the first acts of the number of vertices. Result.txt exported to China.
Date : 2025-07-16 Size : 7kb User : 王军
[Data structs] StrongComent DL : 0: 求有向图的强连通分量，使用2次dfs的算法，具体名字我也忘掉了-Order to have a strongly connected directed graph component, the use of 2 dfs algorithm, the specific name I have forgotten
Date : 2025-07-16 Size : 2kb User : zzq
[MPI] connect DL : 0: 顶点倒塌（Vertex Collapse）算法中，一开始图中的N个顶点看作N个孤立的超顶点(Super Vertex)，算法运行中，有边连通的超顶点相继合并，直到形成最后的整个连通分量。每个顶点属于且仅属于一个超顶点，超顶点中标号最小者称为该超顶点的根。-Collapsed vertex (Vertex Collapse) algorithm, one began to map the N vertices as N isolated vertices super (Super Vertex), algorithm, there are the super-edge-connected vertices have merged to form the final until the entire connected component . Each vertex belongs to and only belong to one super-vertex, super-vertex in the smallest numbers are referred to as the root of the super-vertex.
Date : 2025-07-16 Size : 2kb User : chj
[Special Effects] ImageLabel DL : 0: java实现图像连通区域算法 *ImageLabel is an algorithm that applies Connected Component Labeling *alogrithm to an input image. Only mono images are catered for.-*ImageLabel is an algorithm that applies Connected Component Labeling *alogrithm to an input image. Only mono images are catered for.
Date : 2025-07-16 Size : 3kb User : 程磊
[Windows Develop] contour_cca DL : 0: A rough implementation of "A Component-Labeling Algorithm Using Contour Tracing Technique" paper on an implementation of connected component algorithm using contour tracing, allowing the algorithm to do connected component labelling with just one pass through the image.
Date : 2025-07-16 Size : 986kb User : Hao Wooi Lim
[Mathimatics-Numerical algorithms] xxd DL : 0: 二值图像连通域标记快速算法,能进行区域检测，附代说明文档-Binary image connected component labeling fast algorithm that can detect regional, with a generation of documentation
Date : 2025-07-16 Size : 46kb User : lq8712b3
[Mathimatics-Numerical algorithms] 112 DL : 0: 二值图像连通域标记快速算法,能进行区域检测，附代说明文档，VB开发-Binary image connected component labeling fast algorithm that can detect regional, with a generation of documentation
Date : 2025-07-16 Size : 44kb User : lq8712b3
[MPI] ccl1 DL : 0: 连通图程序源码,实验环境是Linux 欢迎下载-connected component labeling algorithm the environment of experiment is linux welcome to download
Date : 2025-07-16 Size : 6kb User : jack
[Algorithm] ConnectedComponentLabel.UnionFind DL : 0: F# Connected Component Union-Find Algorithm from MSDN Developer
Date : 2025-07-16 Size : 3kb User : iggy0076
[Special Effects] ApplicationsOfDepth-FirstTraversal DL : 0: 1. 用ＤＦＳ判断一个无向图是否是连通图； 2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边； 3. 用ＤＦＳ和点消除求有向图的拓扑排序； 4. 判断有向图是不是强连通图，若不是，求强连通分量； 5. 判断有向图是不是半连同图； 6. 判断有向图是不是单连通图； 7. 判断无向图是不是双连通图。通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。 -1. Using DFS to test if a given undirected graph is connected or not. 2. Classify the edges of a directed graph into tree edges, back edges, forward edges or cross edges by a depth-first traversal of the graph. If the given graph is undirected, classify the edges into tree edges and back edges. And verify if a directed or undirected graph has a cycle. 3. Compute the topological order of a directed graph using both DFS algorithm and source removal algorithm. 4. A strongly connected graph is a directed graph with every pair of vertices reachable from each other. A strongly connected component C of a directed graph G is a subset of maximal vertices such that every pair of vertices in the subset are reachable from each other. A strongly connected component graph GSCC of a graph G is a directed graph that each component C of G is considered as a single vertex in GSCC and there is an edge between components C1 and C2 if there exist an edge (u, v) in the graph G with u belongs to C1 and v
Date : 2025-07-16 Size : 10kb User : 卢竹江
[matlab] Connected-component-labelling-by-an-Iterative-alg DL : 0: Connected component labeling by an Iterative algorithm used for labeling image pixel.It will divide the region according to pixel value.
Date : 2025-07-16 Size : 10kb User : Manish
[OpenCV] TrackingBlobAlgorithms DL : 0: This contained BG/FG detection(simple version and adaptive background mixture models), blob tracking(connected component tracking and MSPF resolver, mean shift, particle filter), Kalman filter using OpenCV. It can be helpful who studying object detection and tracking algorithm. Also, It contain the video clip for testing algorithm.-This is contained BG/FG detection(simple version and adaptive background mixture models), blob tracking(connected component tracking and MSPF resolver, mean shift, particle filter), Kalman filter using OpenCV. It can be helpful who studying object detection and tracking algorithm. Also, It contain the video clip for testing algorithm.
Date : 2025-07-16 Size : 50.16mb User : byunghee
[Algorithm] Source DL : 0: The Strongly connected component algorithm. This is my exercise of Introduction to Algorithm subject.
Date : 2025-07-16 Size : 57kb User : william
[Special Effects] Image-connected-component-labeling DL : 0: 这是一个使用vc++实现的图像连通区域标记算法，可以找出二值化图像的连通域个数。-This is achieved using vc++ image connected component labeling algorithm can find the binary image of the number of connected domains.
Date : 2025-07-16 Size : 169kb User : 王帅
[GDI-Bitmap] Binary-image-connected-domain DL : 0: 这里列举二值图像连通域标记算法包括直接扫描标记算法和二值图像连通域标记快速算法-Here are the binary image connected component labeling algorithm including direct scan labeling algorithm and a binary image connected component labeling fast algorithm
Date : 2025-07-16 Size : 65kb User : 宁静
[matlab] Connected-Component-based-text-region-extraction. DL : 0: The basic steps of the connected-component text extraction algorithm are given below, and diagrammed in Figure 10. The details are discussed in the following sections. 1. Convert the input image to YUV color space. The luminance(Y) value is used for further processing. The output is a gray image. 2. Convert the gray image to an edge image. 3. Compute the horizontal and vertical projection profiles of candidate text regions using a histogram with an appropriate threshold value. 4. Use geometric properties of text such as width to height ratio of characters to eliminate possible non-text regions. 5. Binarize the edge image enhancing only the text regions against a plain black background. 6. Create the Gap Image (as explained in the next section) using the gap-filling process and use this as a reference to further eliminate non-text regions the output. -The basic steps of the connected-component text extraction algorithm are given below, and diagrammed in Figure 10. The details are discussed in the following sections. 1. Convert the input image to YUV color space. The luminance(Y) value is used for further processing. The output is a gray image. 2. Convert the gray image to an edge image. 3. Compute the horizontal and vertical projection profiles of candidate text regions using a histogram with an appropriate threshold value. 4. Use geometric properties of text such as width to height ratio of characters to eliminate possible non-text regions. 5. Binarize the edge image enhancing only the text regions against a plain black background. 6. Create the Gap Image (as explained in the next section) using the gap-filling process and use this as a reference to further eliminate non-text regions the output.
Date : 2025-07-16 Size : 41kb User : Lee Kurian
[Data structs] shujujiegousuanfa DL : 0: 各种最小生成树算法最短路径算法邻接矩阵和邻接表的相互转化求连通分量的算法(Interconversion of various minimum spanning tree algorithm shortest path algorithm adjacency matrix and adjacency list of requirements connected component algorithm)
Date : 2025-07-16 Size : 13kb User : 举杯邀月

« 12 3 4 »