by F. R. Schmidt, E. Toeppe and D. Cremers
Reference:
Efficient Planar Graph Cuts with Applications in Computer Vision (F. R. Schmidt, E. Toeppe and D. Cremers), In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2009. (Note: This version of the paper is modified with respect to the published one: In the published version we had only cited the PhD thesis [2], as the conference paper [3] does not mention Step 13 of Algorithm 2 that restores the important property of T being a rooted tree.)
Bibtex Entry:
@string{cvpr="IEEE Conference on Computer Vision and Pattern Recognition (CVPR)"}
@inproceedings{Schmidt-et-al-cvpr09,
author = {F. R. Schmidt and E. Toeppe and D. Cremers},
title = {Efficient Planar Graph Cuts with Applications in Computer Vision},
booktitle = {IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
year = {2009},
address = {Miami, Florida},
month = {jun},
titleurl = {schmidt_et_al_cvpr09.pdf},
award = {Received a CVPR Doctoral Spotlight Award},
topic = {Shape Analysis},
keywords = {shape-analysis},
pages = {351-356},
}