Graph Cuts and Efficient N-D Image Segmentation
Top Cited Papers
- 1 November 2006
- journal article
- Published by Springer Science and Business Media LLC in International Journal of Computer Vision
- Vol. 70 (2), 109-131
- https://doi.org/10.1007/s11263-006-7934-5
Abstract
No abstract availableKeywords
This publication has 56 references indexed in Scilit:
- An Integral Solution to Surface Evolution PDEs Via Geo-cutsLecture Notes in Computer Science, 2006
- Globally minimal surfaces by continuous maximal flowsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic ApproachIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- An experimental comparison of min-cut/max- flow algorithms for energy minimization in visionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Interactive Image Segmentation Using an Adaptive GMMRF ModelLecture Notes in Computer Science, 2004
- Computing geodesics and minimal surfaces via graph cutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Flux maximizing geometric flowsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Interactive graph cuts for optimal boundary & region segmentation of objects in N-D imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Using dynamic programming for solving variational problems in visionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1990
- A new approach to the maximum-flow problemJournal of the ACM, 1988