Randomly Walking Can Get You Lost: Graph Segmentation with Unknown Edge Weights.
Hanno AckermannBjörn ScheuermannTat-Jun ChinBodo RosenhahnPublished in: EMMCVPR (2014)
Keyphrases
- edge weights
- weighted graph
- bipartite graph
- spanning tree
- directed graph
- shortest path
- superpixels
- minimum spanning tree
- segmentation algorithm
- multiscale
- image segmentation
- graph clustering
- satisfy the triangle inequality
- minimum weight
- segmentation method
- shape prior
- level set
- object segmentation
- directed acyclic graph
- undirected graph
- object recognition
- dense subgraphs
- medical images
- energy function
- object detection