An approach to image segmentation based on shortest paths in graphs.
Andrzej BrzozaGrzegorz MuszynskiPublished in: IWSSIP (2017)
Keyphrases
- shortest path
- image segmentation
- finding the shortest path
- weighted graph
- graph partitioning
- shortest path problem
- shortest path algorithm
- graph search
- betweenness centrality
- edge weights
- strongly connected components
- image processing
- dynamic programming
- flow graph
- road network
- boundary detection
- computer vision
- graph cuts
- level set
- travel time
- minimum cost flow
- shortest distance
- graph model
- spectral clustering
- minimum length
- segmentation algorithm
- graph theory
- bipartite graph
- optimal path
- directed graph
- deformable models
- segmentation method
- active contours
- markov random field