A Faster, Unbiased Path Opening by Upper Skeletonization and Weighted Adjacency Graphs.
Teo AsplundCris L. Luengo HendriksPublished in: IEEE Trans. Image Process. (2016)
Keyphrases
- strongly connected
- weighted graph
- directed graph
- shortest path
- edge weights
- graph matching
- parallel thinning algorithm
- spectral graph
- graph representation
- binary images
- graph partitioning
- graph theoretic
- graph theory
- endpoints
- graph mining
- morphological operations
- graph structure
- undirected graph
- complex structures
- optimal path
- thinning algorithm
- distance transform
- distance transformation
- skeleton extraction
- neural network