Interactive segmentation with Intelligent Scissors
Graphical Models and Image Processing
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
A local search approximation algorithm for k-means clustering
Proceedings of the eighteenth annual symposium on Computational geometry
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Normalized Cuts and Image Segmentation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Texture Segmentation by Multiscale Aggregation of Filter Responses and Shape Elements
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
Hi-index | 0.00 |
In this paper, we describe a fast semi-automatic segmentation algorithm. A nodes aggregation method is proposed for improving the running time and a Graph-Cuts method is used to model the segmentation problem. The whole process is interactive. Once the users specify the interest regions by drawing a few lines, the segmentation process is reliably computed automatically no additional users’ efforts are required. It is convenient and efficient in practical applications. Experiments are given and outputs are encouraging.