Homogeneous Superpixels from Markov Random Walks

@article{Perbet2012HomogeneousSF,
  title={Homogeneous Superpixels from Markov Random Walks},
  author={Frank Perbet and Bj{\"o}rn Stenger and Atsuto Maki},
  journal={IEICE Transactions},
  year={2012},
  volume={95-D},
  pages={1740-1748}
}
This paper presents a novel algorithm to generate homogeneous superpixels from Markov random walks. We exploit Markov clustering (MCL) as the methodology, a generic graph clustering method based on stochastic flow circulation. In particular, we introduce a graph pruning strategy called compact pruning in order to capture intrinsic local image structure. The resulting superpixels are homogeneous, i.e. uniform in size and compact in shape. The original MCL algorithm does not scale well to a graph… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…