Efficient graph-based image segmentation¶
Felzenszwalb, P. F., & Huttenlocher, D. P. (2004). Efficient graph-based image segmentation. International Journal of Computer Vision, 59(2), 167-181.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Segmentation and Boundary Drawing
- The process of partitioning a continuous domain into discrete categories via boundary placement, where boundaries concentrate meaning and classification structure, as Felzenszwalb and Huttenlocher (2004) formalize for image segmentation by defining predicates over evidence for boundaries between regions.
This sourceCanonical formulation of image segmentation as boundary placement: defines a predicate over evidence for a boundary between regions and partitions a continuous image into discrete regions accordingly.
- The process of partitioning a continuous domain into discrete categories via boundary placement, where boundaries concentrate meaning and classification structure, as Felzenszwalb and Huttenlocher (2004) formalize for image segmentation by defining predicates over evidence for boundaries between regions.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:901830b49921 · see in the full table