Graph Cuts and Efficient N-D Image Segmentation

Explore this paper's citation graph

Summary

This application epitomizes the best features of combinatorial graph cuts methods in vision: global optima, practical efficiency, numerical robustness, ability to fuse a wide range of visual cues and constraints, unrestricted topological properties of segments, and applicability to N-D problems.

Type
article
Published
2006-11-01
Cited by
2,238
References
86
Access
Open access

Keywords

Segmentation, Cut, Image segmentation, Computer science, Artificial intelligence

References

Cited by

Related papers