An image segmentation framework based on patch segmentation fusion. Zhang, L.; Wang, X.; Penwarden, N.; and Ji, Q. In Proceedings - International Conference on Pattern Recognition, volume 2, pages 187-190, 2006.
An image segmentation framework based on patch segmentation fusion [pdf]Paper  abstract   bibtex   
In this paper we present an image segmentation frame-work based on patch segmentation fusion. An image is first split into small patches. Segmentation is then performed on each patch using the algorithms of standard normalized cut [9], mean shift clustering [3], or K-means clustering. Each region in a patch segmentation is assigned a label so as to represent different parts. After that, a connectedness value is calculated between any two overlapping patch segmentations with certain kinds of labeling. A weight called border strength is calculated for a segmentation with a certain labeling. We optimize a global criterion function that quantifies the consistency and quality of patch segmentations by a simulated annealing algorithm [5] in order to find the optimal patch segmentations and labeling. Finally, global segmentation is reconstructed by fusing patch segmentations by multiple techniques. Experimental results on natural images are reported. Precision and recall rates are also calculated to evaluate the performance quantitively. © 2006 IEEE.
@inProceedings{
 title = {An image segmentation framework based on patch segmentation fusion},
 type = {inProceedings},
 year = {2006},
 identifiers = {[object Object]},
 pages = {187-190},
 volume = {2},
 id = {d6e1ef6f-8fea-3e62-9ee4-36ad0387da53},
 created = {2010-03-02T17:23:48.000Z},
 file_attached = {true},
 profile_id = {1190d734-205a-3e2c-a21b-094e2b7c88e9},
 last_modified = {2020-01-01T23:51:48.638Z},
 read = {true},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 citation_key = {Sroubek2006b},
 private_publication = {false},
 abstract = {In this paper we present an image segmentation frame-work based on patch segmentation fusion. An image is first split into small patches. Segmentation is then performed on each patch using the algorithms of standard normalized cut [9], mean shift clustering [3], or K-means clustering. Each region in a patch segmentation is assigned a label so as to represent different parts. After that, a connectedness value is calculated between any two overlapping patch segmentations with certain kinds of labeling. A weight called border strength is calculated for a segmentation with a certain labeling. We optimize a global criterion function that quantifies the consistency and quality of patch segmentations by a simulated annealing algorithm [5] in order to find the optimal patch segmentations and labeling. Finally, global segmentation is reconstructed by fusing patch segmentations by multiple techniques. Experimental results on natural images are reported. Precision and recall rates are also calculated to evaluate the performance quantitively. © 2006 IEEE.},
 bibtype = {inProceedings},
 author = {Zhang, Lei and Wang, Xun and Penwarden, Nicholas and Ji, Qiang},
 booktitle = {Proceedings - International Conference on Pattern Recognition}
}
Downloads: 0