By Coda Phillips and Dylan Homuth
Abstract
This paper detail our implementation of a graph based segmentation algorithm created by Felzenszwalb and Huttenlocher. The algorithm represents an image as a graph and defines a predicate to measure evidence of a boundary between two regions. This is highly efficient running in O(n log(n)) however it comes with a trade off in strict accuracy. We tested our implementation using the Berkeley dataset which established a standardized scoring method to better compare segmentation algorithms to a ground truth segmentation created by humans.
Results
