ML Anthology

Fast and Reliable Color Region Merging Inspired by Decision Tree Pruning

Richard Nock
CVPR 2001 pp. I:271-
doi:10.1109/CVPR.2001.990486 /cvpr/2001/nock2001cvpr-fast/

Abstract

In this paper, we exploit some previous theoretical results about decision tree pruning to derive a color segmentation algorithm which avoids some of the common drawbacks of region merging techniques. The algorithm has both statistical and computational advantages over known approaches. It authorizes the processing of 512/spl times/512 images in less than a second on conventional PC computers. Experiments are reported on thirty-five images of various origins, illustrating the quality of the segmentations obtained.

CVPR Semantic Scholar

Cite

Text

Nock. "Fast and Reliable Color Region Merging Inspired by Decision Tree Pruning." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001. doi:10.1109/CVPR.2001.990486

Markdown

[Nock. "Fast and Reliable Color Region Merging Inspired by Decision Tree Pruning." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001.](https://mlanthology.org/cvpr/2001/nock2001cvpr-fast/) doi:10.1109/CVPR.2001.990486

BibTeX

@inproceedings{nock2001cvpr-fast,
  title     = {{Fast and Reliable Color Region Merging Inspired by Decision Tree Pruning}},
  author    = {Nock, Richard},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2001},
  pages     = {I:271-},
  doi       = {10.1109/CVPR.2001.990486},
  url       = {https://mlanthology.org/cvpr/2001/nock2001cvpr-fast/}
}