On the Performance of Connected Components Grouping

@article{Berengolts2001OnTP,
  title={On the Performance of Connected Components Grouping},
  author={Alexander Berengolts and Michael Lindenbaum},
  journal={International Journal of Computer Vision},
  year={2001},
  volume={41},
  pages={195-216}
}
Grouping processes may benefit computationally when simple algorithms are used as part of the grouping process. In this paper we consider a common and extremely fast grouping process based on the connected components algorithm. Relying on a probabilistic model, we focus on analyzing the algorithm's performance. In particular, we derive the expected number of addition errors and the group fragmentation rate. We show that these performance figures depend on a few inherent and intuitive parameters… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Special issue on perceptual organization in computer vision

  • Press London, K. L. Orlando. Boyer, S. Sarkar
  • 1999

Quantitative analysis of grouping processes

  • Michael Lindenbaum.
  • 1996

Robust and e  cient detection of salient convex groups

  • David W. Jacobs.
  • IEEETranslations on Pattern Recognitions and…
  • 1996

Similar Papers

Loading similar papers…