DMCA
Interactive Graph Cut Based Segmentation With Shape Priors (2005)
Cached
Download Links
- [www.vision.cs.rpi.edu]
- [www.cs.rpi.edu]
- [www.cs.rpi.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN CVPR, PAGES I: 755–762 |
| Citations: | 116 - 0 self |
BibTeX
@INPROCEEDINGS{Freedman05interactivegraph,
author = {Daniel Freedman and Tao Zhang},
title = {Interactive Graph Cut Based Segmentation With Shape Priors},
booktitle = {IN CVPR, PAGES I: 755–762},
year = {2005},
pages = {755--762},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
... alternative to pure automatic segmentation in many applications. While automatic segmentation can be very challenging, a small amount of user input can often resolve ambiguous decisions on the part of the algorithm. In this work, we devise a graph cut algorithm for interactive segmentation which incorporates shape priors. While traditional graph cut approaches to interactive segmentation are often quite successful, they may fail in cases where there are diffuse edges, or multiple similar objects in close proximity to one another. Incorporation of shape priors within this framework mitigates these problems. Positive results on both medical and natural images are demonstrated.
